Moments of the inverse participation ratio for the Laplacian on finite regular graphs
From MaRDI portal
Publication:4629616
Random graphs (graph-theoretic aspects) (05C80) Association schemes, strongly regular graphs (05E30) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)
Abstract: We investigate the first and second moments of the inverse participation ratio (IPR) for all eigenvectors of the Laplacian on finite random regular graphs with vertices and degree . By exactly diagonalizing a large set of -regular graphs, we find that as becomes large, the mean of the inverse participation ratio on each graph, when averaged over a large ensemble of graphs, approaches the numerical value . This universal number is understood as the large- limit of the average of the quartic polynomial corresponding to the IPR over an appropriate -dimensional hypersphere of . For a large, but not exhaustive ensemble of graphs, the mean variance of the inverse participation ratio for all graph Laplacian eigenvectors deviates from its continuous hypersphere average due to large graph-to-graph fluctuations that arise from the existence of highly localized modes.
Recommendations
- Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
- Localization of eigenvectors in random graphs
- scientific article; zbMATH DE number 1552110
- Convergence of the density of states and delocalization of eigenvectors on random regular graphs
- Random incidence matrices: moments of the spectral density
Cites work
- scientific article; zbMATH DE number 1552110 (Why is no real title available?)
- A note on a method for generating points uniformly on n -dimensional spheres
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Bulk eigenvalue statistics for random regular graphs
- Convergence of the density of states and delocalization of eigenvectors on random regular graphs
- Eigenvector statistics of sparse random matrices
- Eigenvectors of random graphs: nodal domains
- Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
- Expander graphs and their applications
- Fast generation of regular graphs and construction of cages
- First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
- Generating Random Regular Graphs Quickly
- Graph theory and statistical physics
- How to Integrate a Polynomial over a Sphere
- Local semicircle law for random regular graphs
- Localization of eigenvectors in random graphs
- Mathematical methods of statistics.
- Non-localization of eigenfunctions on large regular graphs
- Some geometric aspects of graphs and their eigenfunctions
- Sparse random graphs: eigenvalues and eigenvectors
- Sparse regular random graphs: spectral density and eigenvectors
- Symmetric Random Walks on Groups
- The eigenvalues of random symmetric matrices
- The expected eigenvalue distribution of a large regular graph
- The on-line encyclopedia of integer sequences
- Trace formulas and spectral statistics for discrete Laplacians on regular graphs (II)
- Universality for mathematical and physical systems
This page was built for publication: Moments of the inverse participation ratio for the Laplacian on finite regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629616)