arXiv Open Access 2021

On Near Optimal Spectral Expander Graphs of Fixed Size

Clark Alexander

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM math.CO stat.ME

Penulis (1)

Clark Alexander

Format Sitasi

APA MLA BibTeX

Alexander, C. (2021). On Near Optimal Spectral Expander Graphs of Fixed Size. https://arxiv.org/abs/2110.01407

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓