Simple versus nonsimple loops on random regular graphs

DOI10.1002/jgt.23056arXiv2209.11218OpenAlexW4388850633MaRDI QIDQ6199381

Benjamin Dozier, Jenya Sapir

Publication date: 23 February 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

random graphsregular graphsspectral graph theorynonbacktracking walk

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Cutoff on all Ramanujan graphs
• Cutoff phenomena for random walks on random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On the second eigenvalue and random walks in random \(d\)-regular graphs
• Random construction of Riemann surfaces
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• On the minimal diameter of closed hyperbolic surfaces
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• A proof of Alon’s second eigenvalue conjecture and related problems
• The non-backtracking spectrum of the universal cover of a graph

This page was built for publication: Simple versus nonsimple loops on random regular graphs