The Largest Eigenvalue of Sparse Random Graphs
From MaRDI portal
Publication:4796726
DOI10.1017/S0963548302005424zbMath1012.05109arXivmath/0106066OpenAlexW2003134180MaRDI QIDQ4796726
Michael Krivelevich, Benjamin Sudakov
Publication date: 13 June 2003
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0106066
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (46)
Universality of the mean-field for the Potts model ⋮ A limit theorem for scaled eigenvectors of random dot product graphs ⋮ Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ Noise sensitivity for the top eigenvector of a sparse random matrix ⋮ Concentration of the spectral norm of Erdős-Rényi random graphs ⋮ Locating the eigenvalues of trees ⋮ Robustness of random graphs based on graph spectra ⋮ Spectral distributions of adjacency and Laplacian matrices of random graphs ⋮ Spectra of edge-independent random graphs ⋮ The spectra of random mixed graphs ⋮ Outliers in spectrum of sparse Wigner matrices ⋮ Upper tail of the spectral radius of sparse Erdös-Rényi graphs ⋮ Detection thresholds in very sparse matrix completion ⋮ Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs ⋮ Localized phase for the Erdős-Rényi graph ⋮ The skew spectral radius and skew Randić spectral radius of general random oriented graphs ⋮ Patterned sparse random matrices: A moment approach ⋮ Learning sparse graphons and the generalized Kesten-Stigum threshold ⋮ Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs ⋮ Spectral norm bounds for block Markov chain random matrices ⋮ On the spectra of general random mixed graphs ⋮ Centrality metrics and localization in core-periphery networks ⋮ Graph Partitioning via Adaptive Spectral Techniques ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ On connected diagrams and cumulants of Erdős-Rényi matrix models ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ The Hopfield model on a sparse Erdös-Renyi graph ⋮ On the Laplacian Eigenvalues of Gn,p ⋮ Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT ⋮ Lifshitz tails for spectra of Erdős-Rényi random graphs ⋮ Extremal eigenvalues of critical Erdős-Rényi graphs ⋮ Spectral edge in sparse random graphs: upper and lower tail large deviations ⋮ Capacity of an associative memory model on random graph architectures ⋮ Sparse random tensors: concentration, regularization and applications ⋮ A remark on the spectra of random graphs with given expected degrees ⋮ A spectral signature of breaking of ensemble equivalence for constrained random graphs ⋮ An approximation algorithm for the maximum spectral subgraph problem ⋮ Constructive regularization of the random matrix norm ⋮ Large deviations for the largest eigenvalue of Gaussian networks with constant average degree ⋮ Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs ⋮ Global and individualized community detection in inhomogeneous multilayer networks ⋮ Top eigenpair statistics for weighted sparse graphs ⋮ Loose laplacian spectra of random hypergraphs ⋮ On High Moments of Strongly Diluted Large Wigner Random Matrices ⋮ On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs
This page was built for publication: The Largest Eigenvalue of Sparse Random Graphs
