Second largest eigenpair statistics for sparse graphs
From MaRDI portal
Publication:5876312
DOI10.1088/1751-8121/ABCBADOpenAlexW3025815483MaRDI QIDQ5876312
Vito A. R. Susca, Pierpaolo Vivo, Reimer Kühn
Publication date: 1 February 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05306
random matricesreplica methodrandom graphspopulation dynamicssecond eigenvaluesecond eigenvectorcavity method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for the second largest eigenvalue of symmetric nonnegative matrices
- Notes on the second largest eigenvalue of a graph
- Eigenvalues and expanders
- The expected eigenvalue distribution of a large regular graph
- On the second eigenvalue of a graph
- Clustering based on eigenvectors of the adjacency matrix
- On the almost eigenvectors of random regular graphs
- Principal component analysis: a review and recent developments
- Spectra of modular and small-world matrices
- Resolvent of large random graphs
- Symmetric Random Walks on Groups
- 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
- Sparse random matrices: the eigenvalue spectrum revisited
- Eigenvalue distribution of large weighted random graphs
- Glassy dynamics on networks: local spectra and return probabilities
- Random Matrix Spectra and Relaxation in Complex Networks
- Numerical Methods in Matrix Computations
- Generalized Alon--Boppana Theorems and Error-Correcting Codes
- Finitely coordinated models for low-temperature phases of amorphous systems
- Spectral theory of sparse non-Hermitian random matrices
- Top eigenpair statistics for weighted sparse graphs
This page was built for publication: Second largest eigenpair statistics for sparse graphs
