SearcharxivSearch

arXiv · 2603.04076

Limiting empirical spectral measure of the normalized Laplacian in preferential attachment graphs

Abstract

We study the empirical spectral distribution of the normalized Laplacian of linear preferential attachment graphs in the Barab{\'a}si-Albert regime with fixed out-degree. For the resulting sequence of random multigraphs, we prove that the empirical spectral distribution converges weakly in probability to a deterministic probability measure supported on the interval [0, 2]. The limit is characterized via the local weak limit of preferential attachment graphs (the P{\'o}lya-point graph): the limiting Stieltjes transform is given by the expected diagonal Green function at the root of the normalized Laplacian operator on this infinite random graph. The proof combines a resolvent approach with a uniform Neumann-series expansion for the normalized Laplacian, a random-walk representation in terms of return probabilities on decorated neighborhoods, a truncation and Doob martingale-Azuma-Hoeffding concentration argument along the PA filtration, and an analytic continuation argument based on normal families.

Explore related subjects

Keep this discovery

BibTeXRIS

Malika Kharouf. 2026-03-04. Limiting empirical spectral measure of the normalized Laplacian in preferential attachment graphs. https://arxiv.org/abs/2603.04076

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