On the Laplacian Eigenvalues of Gn,p

DOI10.1017/S0963548307008693zbMath1127.05062MaRDI QIDQ5428368

Amin Coja-Oghlan

Publication date: 22 November 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

Laplacian eigenvaluesSpectral gapRandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The power of two choices for random walks, On the spectrum of dense random geometric graphs, Spectral statistics of sparse Erdős-Rényi graph Laplacians, Spectra of edge-independent random graphs, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, Unnamed Item, Algebraic and combinatorial expansion in random simplicial complexes, On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?, Modularity of Erdős‐Rényi random graphs, On the spectra of general random mixed graphs, On eigenvalues of random complexes, Banach space actions and \(L^2\)-spectral gap, Accelerated information dissemination on networks with local and global edges, Loose laplacian spectra of random hypergraphs

Cites Work

• On the distribution of the roots of certain symmetric matrices
• The eigenvalues of random symmetric matrices
• Lifshitz tails for spectra of Erdős-Rényi random graphs
• A spectral heuristic for bisecting random graphs
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• A Spectral Technique for Coloring Random 3-Colorable Graphs
• On the Quality of Spectral Separators
• The Spectra of Random Graphs with Given Expected Degrees
• The Largest Eigenvalue of Sparse Random Graphs
• Spectral techniques applied to sparse random graphs
• The First Eigenvalue of Random Graphs
• Random incidence matrices: moments of the spectral density