Top eigenpair statistics for weighted sparse graphs
From MaRDI portal
Publication:5872986
DOI10.1088/1751-8121/ab4d63OpenAlexW3102308669MaRDI QIDQ5872986
Pierpaolo Vivo, Vito A. R. Susca, Reimer Kühn
Publication date: 5 January 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09852
Related Items (2)
Hypothesis testing in sparse weighted stochastic block model ⋮ Second largest eigenpair statistics for sparse graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse regular random graphs: spectral density and eigenvectors
- Unveiling the significance of eigenvectors in diffusing non-Hermitian matrices by identifying the underlying Burgers dynamics
- The expected eigenvalue distribution of a large regular graph
- The eigenvalues of random symmetric matrices
- Probing non-orthogonality of eigenvectors in non-Hermitian matrix models: diagrammatic approach
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- On statistics of bi-orthogonal eigenvectors in real and complex Ginibre ensembles: combining partial Schur decomposition with supersymmetry
- Eigenvector statistics of sparse random matrices
- On the almost eigenvectors of random regular graphs
- Outlier Eigenvalues for Deformed I.I.D. Random Matrices
- First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
- Rare events statistics of random walks on networks: localisation and other dynamical phase transitions
- Spectra of modular and small-world matrices
- Resolvent of large random graphs
- Symmetric Random Walks on Groups
- A spectral heuristic for bisecting random graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectra of sparse random matrices
- Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
- Spectral density of random graphs with topological constraints
- Spectra of modular random graphs
- The eigenvalue spectrum of a large symmetric random matrix
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- Sparse random matrices: the eigenvalue spectrum revisited
- The Many Proofs and Applications of Perron's Theorem
- Introduction to Random Matrices
- The Largest Eigenvalue of Sparse Random Graphs
- Eigenvalue distribution of large weighted random graphs
- Sparse random graphs: Eigenvalues and eigenvectors
- Dynamical TAP approach to mean field glassy systems
- Modern Quantum Mechanics
- Random Matrix Spectra and Relaxation in Complex Networks
- Fat-tailed distribution derived from the first eigenvector of a symmetric random sparse matrix
- The First Eigenvalue of Random Graphs
- Finitely coordinated models for low-temperature phases of amorphous systems
This page was built for publication: Top eigenpair statistics for weighted sparse graphs
