Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
From MaRDI portal
Publication:3544810
DOI10.1088/1751-8113/41/43/435203zbMath1157.39314arXiv0804.2771OpenAlexW3103798623MaRDI QIDQ3544810
Publication date: 8 December 2008
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.2771
Related Items (13)
Quantum ergodicity on regular graphs ⋮ Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Quantum Ising model in transverse and longitudinal fields: chaotic wave functions ⋮ Cycles and eigenvalues of sequentially growing random regular graphs ⋮ Many nodal domains in random regular graphs ⋮ Moments of the inverse participation ratio for the Laplacian on finite regular graphs ⋮ Poisson eigenvalue statistics for random Schrödinger operators on regular graphs ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ Spectral Experiments+ ⋮ Quantum ergodicity on large regular graphs ⋮ Discrete Graphs – A Paradigm Model for Quantum Chaos ⋮ Top eigenpair statistics for weighted sparse graphs ⋮ Second largest eigenpair statistics for sparse graphs
This page was built for publication: Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
