✦ LIBER ✦

Sparse regular random graphs: Spectral density and eigenvectors

✍ Scribed by Dumitriu, Ioana; Pal, Soumik

Book ID: 125838725
Publisher: Institute of Mathematical Statistics
Year: 2012
Tongue: English
Weight: 326 KB
Volume: 40
Category: Article
ISSN: 0091-1798
DOI: 10.1214/11-AOP673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse random graphs: Eigenvalues and ei

Sparse random graphs: Eigenvalues and eigenvectors

✍ Linh V. Tran; Van H. Vu; Ke Wang 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

Eigenvectors and eigenvalues of non-regu

Eigenvectors and eigenvalues of non-regular graphs

✍ Xiao-Dong Zhang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Bisecting sparse random graphs

✍ Malwina J. Luczak; Colin McDiarmid 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

Spectral density of random graphs with t

Spectral density of random graphs with topological constraints

✍ Rogers, Tim; Vicente, Conrad Pérez; Takeda, Koujin; Castillo, Isaac Pérez 📂 Article 📅 2010 🏛 IOP Publishing 🌐 English ⚖ 552 KB

Sparse pseudo-random graphs are Hamilton

Sparse pseudo-random graphs are Hamiltonian

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a __d__‐regular graph __G__ on __n__ vertices satisfies and __n__ is large enough, then __G__ is Hamiltonian. We also show how our main resu

Independent sets in random sparse graphs

✍ Pedro G. Gazmuri 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB