On Near Optimal Spectral Expander Graphs of Fixed Size
arXiv:2110.01407
Abstract
We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size regular graphs.
19 pages, 23 images, 12 figures, 7 algorithms, 19 references