On the almost eigenvectors of random regular graphs

DOI10.1214/18-AOP1294zbMath1414.05259arXiv1607.04785OpenAlexW2962985657MaRDI QIDQ2421826

Balázs Szegedy, Agnes Backhausz

Publication date: 18 June 2019

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

random regular graphsgraph limitsgroup-invariant processes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52)

Related Items (16)

The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph ⋮ Symmetric Measures, Continuous Networks, and Dynamics ⋮ Singularity of the \(k\)-core of a random graph ⋮ Many nodal domains in random regular graphs ⋮ Spectrum of random d‐regular graphs up to the edge ⋮ Eigenvectors of the square grid plus GUE ⋮ Edge rigidity and universality of random regular graphs of intermediate degree ⋮ Entropy and expansion ⋮ Short geodesic loops and \(L^p\) norms of eigenfunctions on large genus random surfaces ⋮ Local weak limits of Laplace eigenfunctions ⋮ Mutual information decay for factors of i.i.d. ⋮ Entropy inequalities for factors of IID ⋮ Typicality and entropy of processes on infinite trees ⋮ Top eigenpair statistics for weighted sparse graphs ⋮ Second largest eigenpair statistics for sparse graphs ⋮ Action convergence of operators and graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Functional limit theorems for random regular graphs
• Expansion of random graphs: new proofs, new results
• The eigenvector moment flow and local quantum unique ergodicity
• Perfect matchings as IID factors on non-amenable groups
• Bulk eigenvalue statistics for random regular graphs
• Sparse regular random graphs: spectral density and eigenvectors
• Eigenvectors of random matrices: A survey
• A measurable-group-theoretic solution to von Neumann's problem
• Independence ratio and random eigenvectors in transitive graphs
• Convergence of the density of states and delocalization of eigenvectors on random regular graphs
• The ergodic theory of free group actions: entropy and the \(f\)-invariant
• Ramanujan graphs
• Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
• Eigenvector distribution of Wigner matrices
• Non-localization of eigenfunctions on large regular graphs
• Local algorithms for independent sets are half-optimal
• Quantum ergodicity on large regular graphs
• Eigenvector statistics of sparse random matrices
• Local Kesten-McKay law for random regular graphs
• Limits of locally-globally convergent graph sequences
• On isomorphism of weak Bernoulli transformations
• On the principal components of sample covariance matrices
• RANDOM MATRICES: UNIVERSAL PROPERTIES OF EIGENVECTORS
• Invariant Gaussian processes and independent sets on regular graphs of large girth
• A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
• Ramanujan graphings and correlation decay in local algorithms
• Bulk universality of sparse random matrices
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• A proof of Alon’s second eigenvalue conjecture and related problems
• On large‐girth regular graphs and random processes on trees
• Sparse graphs: Metrics and random models
• Factor of IID Percolation on Trees
• Factors of IID on Trees
• Quantum ergodicity for the Anderson model on regular graphs
• Local Semicircle Law for Random Regular Graphs
• Elements of Information Theory
• BROOKS’ THEOREM FOR MEASURABLE COLORINGS
• Limits of local algorithms over sparse random graphs

This page was built for publication: On the almost eigenvectors of random regular graphs