English

On Near Optimal Spectral Expander Graphs of Fixed Size

Discrete Mathematics 2021-10-05 v1 Combinatorics Methodology
Authors: Clark Alexander
View on arXiv ↗ PDF ↗

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.

Keywords

spectral expander regular graph fixed size heuristic algorithm simulated annealing spectral gap

Cite

@article{arxiv.2110.01407,
  title  = {On Near Optimal Spectral Expander Graphs of Fixed Size},
  author = {Clark Alexander},
  journal= {arXiv preprint arXiv:2110.01407},
  year   = {2021}
}

Comments

19 pages, 23 images, 12 figures, 7 algorithms, 19 references

Related papers

View all related →
Discrete Mathematics · Computer Science
A heuristic approach for dividing graphs into bi-connected components with a size constraint
Raka Jovanovic, Tatsushi Nishi, Stefan Voss
2016-04-19
Signal Processing · Electrical Eng. & Systems
Active Sampling for Approximately Bandlimited Graph Signals
Sijie Lin, Xuan Xie, Hui Feng, Bo Hu
2019-02-19
Quantum Physics · Physics
Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
Yuya Sugie, Yuki Yoshida, Normann Mertig, Takashi Takemoto +6
2020-04-09
Discrete Mathematics · Computer Science
Parallel coarsening of graph data with spectral guarantees
Christopher Brissette, Andy Huang, George Slota
2022-04-26
Distributed, Parallel, and Cluster Computing · Computer Science
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2015-11-10
Combinatorics · Mathematics
Local algorithms, regular graphs of large girth, and random regular graphs
Carlos Hoppen, Nicholas Wormald
2017-03-06
Data Structures and Algorithms · Computer Science
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
Yin Tat Lee, He Sun
2015-08-14
Social and Information Networks · Computer Science
Computing approximate symmetries of complex networks
Anna Pidnebesna, David Hartman, Aneta Pokorná, Matěj Straka +1
2023-12-14
Neural and Evolutionary Computing · Computer Science
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing
Hashem Ezzati, Mahmood Amintoosi, Hashem Tabasi
2019-04-01
Probability · Mathematics
Sampling random graph homomorphisms and applications to network data analysis
Hanbaek Lyu, Facundo Memoli, David Sivakoff
2023-01-11
Social and Information Networks · Computer Science
Generating Connected Random Graphs
Caitlin Gray, Lewis Mitchell, Matthew Roughan
2018-10-29
Data Structures and Algorithms · Computer Science
Time Lower Bounds for the Metropolis Process and Simulated Annealing
Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein
2023-12-22
Numerical Analysis · Mathematics
Graph Sparsification by Approximate Matrix Multiplication
Neophytos Charalambides, Alfred O. Hero
2023-04-27
Artificial Intelligence · Computer Science
Graph Neural Networks for Maximum Constraint Satisfaction
Jan Toenshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2020-02-12
Social and Information Networks · Computer Science
Multiscale Planar Graph Generation
Varsha Chauhan, Alexander Gutfraind, Ilya Safro
2019-05-14
Quantum Physics · Physics
Graph Coloring with Quantum Annealing
Julia Kwok, Kristen Pudenz
2020-12-09
Statistical Mechanics · Physics
Microcanonical simulated annealing: Massively parallel Monte Carlo simulations with sporadic random-number generation
M. Bernaschi, C. Chilin, L. A. Fernandez, I. González-Adalid Pemartín +6
2026-05-07
Machine Learning · Statistics
Sparse Partial Least Squares for Coarse Noisy Graph Alignment
Michael Weylandt, George Michailidis, T. Mitchell Roddenberry
2021-11-03
Data Structures and Algorithms · Computer Science
Graph reduction with spectral and cut guarantees
Andreas Loukas
2019-01-01
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025-07-08
Social and Information Networks · Computer Science
Estimating Network Models using Neural Networks
Angelo Mele
2025-02-05
Machine Learning · Statistics
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu
2019-07-23
Computation · Statistics
Novel Algorithms for Sampling Abstract Simplicial Complexes
John Lombard
2018-07-03
Disordered Systems and Neural Networks · Physics
Spectral density of random graphs with topological constraints
Tim Rogers, Conrad Pérez Vicente, Koujin Takeda, Isaac Pérez Castillo
2011-04-08
Data Structures and Algorithms · Computer Science
Improved Parallel Algorithms for Spanners and Hopsets
Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu
2015-06-25