SearcharxivSearch

arXiv · 1710.07002

Delocalization and Limiting Spectral Distribution of Erd\H{o}s-R\'{e}nyi Graphs with Constant Expected Degree

Abstract

We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson tree with offspring distribution Pois($\lambda$) and the mean spectrum at the root of this tree has unbounded support and corresponds to the limiting spectral distribution of $G(n,p_n)$ as $n\to\infty$. We show that if one weights the edges by $1/\sqrt{\lambda}$ and sends $\lambda\to\infty$, then the support mostly vanishes and in fact, the limiting spectral distributions converge weakly to a semicircle distribution. We also find that for large $\lambda$, there is an orthonormal eigenvector basis of $G(n,p_n)$ such that most of the vectors delocalize with respect to the infinity norm, as $n\to\infty$. Our delocalization result provides a variant on a result of Tran, Vu and Wang (2013).

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Jung, Jaehun Lee. 2017-10-19. Delocalization and Limiting Spectral Distribution of Erd\H{o}s-R\'{e}nyi Graphs with Constant Expected Degree. https://doi.org/10.1214/18-ecp198

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR