The First Eigenvalue of Random Graphs
From MaRDI portal
Publication:5704392
DOI10.1017/S0963548305007030zbMATH Open1077.05092MaRDI QIDQ5704392FDOQ5704392
Authors: Svante Janson
Publication date: 14 November 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- The Largest Eigenvalue of Sparse Random Graphs
- The distribution of eigenvalues of graphs
- On the distribution of eigenvalues of graphs
- Eigenvalues of random power law graphs
- On the distribution of eigenvalues of a simple undirected graph
- The Distribution of the Largest Nontrivial Eigenvalues in Families of Random Regular Graphs
- Partial sum of eigenvalues of random graphs.
- Sparse random graphs: eigenvalues and eigenvectors
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- On the almost eigenvectors of random regular graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80)
Cited In (7)
- On the Laplacian Eigenvalues of Gn,p
- A limit theorem for scaled eigenvectors of random dot product graphs
- The Largest Eigenvalue of Sparse Random Graphs
- Top eigenpair statistics for weighted sparse graphs
- Introduction to complex networks: structure and dynamics
- Entrywise bounds for eigenvectors of random graphs
- Upper tails for edge eigenvalues of random graphs
This page was built for publication: The First Eigenvalue of Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704392)