Quantum graphs are ideally suited to studying the spectral statistics of chaotic systems. Depending on the boundary conditions at the vertices, there are Neumann and Dirichlet graphs. The latter ones correspond to totally disassembled graphs with a spectrum being the superposition of the spectra of the individual bonds. According to the interlacing theorem, Neumann and Dirichlet eigenvalues on average alternate as a function of the wave number, with the consequence that the Neumann spectral statistics deviate from random matrix predictions. There is, e.g., a strict upper bound for the spacing of neighboring Neumann eigenvalues given by the number of bonds (in units of the mean level spacing). Here, we present analytic expressions for level spacing distribution and number variance for ensemble averaged spectra of Dirichlet graphs in dependence of the bond number, and compare them with numerical results. For a number of small Neumann graphs, numerical results for the same quantities are shown, and their deviations from random matrix predictions are discussed.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858025PMC
http://dx.doi.org/10.3390/e25010109DOI Listing

Publication Analysis

Top Keywords

quantum graphs
8
spectral statistics
8
neumann dirichlet
8
dirichlet graphs
8
random matrix
8
matrix predictions
8
level spacing
8
graphs
6
neumann
5
number
5

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!