Sparse random graphs: Eigenvalues and Eigenvectors

Abstract

In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→ ∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdos-R\'enyi random graph G(n,p), answering a question raised by Dekel-Lee-Linial.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…