Eigenvalues of the non-backtracking operator detached from the bulk
From MaRDI portal
Publication:5019004
DOI10.1142/S2010326321500283zbMath1483.60012arXiv1907.05603MaRDI QIDQ5019004
Publication date: 27 December 2021
Published in: Random Matrices: Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05603
quadratic eigenvalue problemstochastic block modelnon-Hermitian perturbationnon-backtracking operator
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05)
Related Items
There is no going back: properties of the non-backtracking Laplacian, Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs, Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction and estimation in the planted partition model
- The dimension-free structure of nonhomogeneous random matrices
- A proof of the block model threshold conjecture
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Zeta functions of finite graphs and coverings
- Random matrices: universality of ESDs and the circular law
- Extremal eigenvalues of critical Erdős-Rényi graphs
- The spectral gap of sparse random digraphs
- Spectra of random regular hypergraphs
- Entrywise eigenvector analysis of random matrices with low expected rank
- Spectral radii of sparse random matrices
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- The Quadratic Eigenvalue Problem
- Spectral redemption in clustering sparse networks
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Graph Powering and Spectral Robustness
- A graphon approach to limiting spectral distributions of Wigner‐type matrices
- The non-backtracking spectrum of the universal cover of a graph
- Community detection thresholds and the weak Ramanujan property