Moments of the inverse participation ratio for the Laplacian on finite regular graphs

DOI10.1088/1751-8121/AAEBB2zbMATH Open1411.82020arXiv1506.02048OpenAlexW568938745MaRDI QIDQ4629616FDOQ4629616

Authors: Timothy B. P. Clark, Adrian del Maestro 

Publication date: 27 March 2019

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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 $n$ vertices and degree $z$. By exactly diagonalizing a large set of $z$-regular graphs, we find that as $n$ becomes large, the mean of the inverse participation ratio on each graph, when averaged over a large ensemble of graphs, approaches the numerical value $3$. This universal number is understood as the large-$n$ limit of the average of the quartic polynomial corresponding to the IPR over an appropriate $(n-2)$-dimensional hypersphere of $mathbb{R}^n$. 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.

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

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

zbMATH Keywords

graph theoryLaplacianlocalizationrandom regular graphsinverse participation ratio

Mathematics Subject Classification ID

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)

Cites Work

• The on-line encyclopedia of integer sequences
• The eigenvalues of random symmetric matrices
• Fast generation of regular graphs and construction of cages
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Mathematical methods of statistics.
• Expander graphs and their applications
• Symmetric Random Walks on Groups
• Local semicircle law for random regular graphs
• Bulk eigenvalue statistics for random regular graphs
• The expected eigenvalue distribution of a large regular graph
• Sparse random graphs: eigenvalues and eigenvectors
• Sparse regular random graphs: spectral density and eigenvectors
• Generating Random Regular Graphs Quickly
• Eigenvectors of random graphs: nodal domains
• Some geometric aspects of graphs and their eigenfunctions
• A note on a method for generating points uniformly on n -dimensional spheres
• Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
• Trace formulas and spectral statistics for discrete Laplacians on regular graphs (II)
• Title not available (Why is that?)
• Universality for mathematical and physical systems
• Non-localization of eigenfunctions on large regular graphs
• How to Integrate a Polynomial over a Sphere
• Convergence of the density of states and delocalization of eigenvectors on random regular graphs
• Eigenvector statistics of sparse random matrices
• Graph theory and statistical physics
• Localization of eigenvectors in random graphs
• First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

Cited In (1)

• Stress response of granular systems

Uses Software

• NetworkX
• OEIS

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)