Abstract
We study the distribution of the number of (nonbacktracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of t-periodic walks and its mean when the cardinality of the vertex set V and the period t approach ∞ as t/V → τ for all τ. This formula is based on the conjecture that the spectral statistics of the adjacency eigenvalues are given by random matrix theory. We provide numerical and theoretical evidence for the validity of this conjecture. The key tool used in this study is a trace formula that expresses the spectral density of d-regular graphs in terms of periodic walks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
