A note on the trace method for random regular graphs

DOI10.1007/s11856-023-2497-5zbMath1525.05170arXiv2006.13605OpenAlexW3037656498MaRDI QIDQ6076192

No author found.

Publication date: 23 October 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.13605

zbMATH Keywords

random \(d\)-regular graphnon-backtracking spectrum of a regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutoff on all Ramanujan graphs
• Primitive words, free factors and measure preservation.
• Expansion of random graphs: new proofs, new results
• Eigenvalues and expanders
• On the second eigenvalue and random walks in random \(d\)-regular graphs
• On the second eigenvalue of a graph
• Relative expanders or weakly relatively Ramanujan graphs.
• Word measures on symmetric groups
• Eigenvalues of random lifts and polynomials of random permutation matrices
• Growth of primitive elements in free groups
• A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
• Expander graphs and their applications
• A proof of Alon’s second eigenvalue conjecture and related problems
• A combinatorial proof of Bass's determinant formula for the zeta function of regular graphs
• Measure preserving words are primitive

This page was built for publication: A note on the trace method for random regular graphs