The Largest Eigenvalue of Sparse Random Graphs
From MaRDI portal
Publication:4796726
DOI10.1017/S0963548302005424zbMath1012.05109arXivmath/0106066MaRDI 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
05C80: Random graphs (graph-theoretic aspects)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Exploring the “Middle Earth” of network spectra via a Gaussian matrix function, On High Moments of Strongly Diluted Large Wigner Random Matrices, Patterned sparse random matrices: A moment approach, On the Laplacian Eigenvalues of Gn,p, Top eigenpair statistics for weighted sparse 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, Localized phase for the Erdős-Rényi graph, The skew spectral radius and skew Randić spectral radius of general random oriented graphs, 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, A limit theorem for scaled eigenvectors of random dot product graphs, Spectra of edge-independent random graphs, The Hopfield model on a sparse Erdös-Renyi graph, Locating the eigenvalues of trees, Spectral distributions of adjacency and Laplacian matrices of random graphs, Sparse regular random graphs: spectral density and eigenvectors, Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT, Constructive regularization of the random matrix norm, On connected diagrams and cumulants of Erdős-Rényi matrix models, Gaussianization of the spectra of graphs and networks. Theory and applications, Extremal eigenvalues of critical Erdős-Rényi graphs, Spectral edge in sparse random graphs: upper and lower tail large deviations, Sparse random tensors: concentration, regularization and applications, A spectral signature of breaking of ensemble equivalence for constrained random graphs, An approximation algorithm for the maximum spectral subgraph problem, 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, On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs, Noise sensitivity for the top eigenvector of a sparse random matrix, Concentration of the spectral norm of Erdős-Rényi random graphs, On the spectra of general random mixed graphs, Asymptotic distribution of Bernoulli quadratic forms, Universality of the mean-field for the Potts model, Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs, Lifshitz tails for spectra of Erdős-Rényi random graphs, Capacity of an associative memory model on random graph architectures, The spectra of random mixed graphs, Spectral norm bounds for block Markov chain random matrices, A remark on the spectra of random graphs with given expected degrees, Robustness of random graphs based on graph spectra, Loose laplacian spectra of random hypergraphs, Centrality metrics and localization in core-periphery networks, Graph Partitioning via Adaptive Spectral Techniques
