Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.02686

Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs

Rajat Subhra Hazra·Nikolai Kriukov·Michel Mandjes
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we consider a dynamic version of the Erdős-Rényi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of the principle eigenvalue of the adjacency matrix in the regime that the number of vertices grows large. The main result is a functional central limit theorem, which displays that the principal eigenvalue essentially inherits the characteristics of the dynamics of the individual edges.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes. 2024-07-02. Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs. https://arxiv.org/abs/2407.02686

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

KEEP EXPLORING

Related papers

arXiv2026

From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees

We uncover a close connection between the second moment of the degree of a typical vertex in a random subgraph and the pairwise negative correlation (p-NC) property. On one hand, we exploit this connection to prove the p-NC property for non-adjacent edges in minimal spanning trees on complete graphs. On the other hand, we apply the classical p-NC property of uniform spanning trees to derive a universal upper bound on the second moment of the degree of a uniformly chosen vertex in uniform spanning trees on finite, connected, regular graphs, thereby resolving an open question posed by Nachmias and Peres. Furthermore, we determine that the optimal upper bound is exactly 6, and the method for achieving this optimal bound is interesting in itself -- the proof uses Edmonds' matroid polytope theorem.

math.PR↗
arXiv2026

High-Dimensional Ultra-Log-Concave Distributions

Ultra-log-concave distributions are ubiquitous in probability, combinatorics, and statistical mechanics and have been studied extensively. In this paper, we introduce a quantitative high-dimensional extension of this notion, called $δ$-ultra-log-concavity, for probability measures on $\mathbb{N}^d$ with downward closed support. When $δ= 1$, this notion coincides with the class studied by Gurvits (2009) via strongly log-concave generating functions, and with the class defined by Anari, Oveis Gharan, and Vinzant (2021) via completely log-concave generating functions; in one dimension, it reduces to classical ultra-log-concavity. We establish several functional inequalities, including a weighted Poincaré inequality, a discrete Brascamp--Lieb inequality, and a weighted Wu-type modified log-Sobolev inequality. Our approach combines integrated Bakry--Émery calculus for a canonical birth-death chain with Poisson stochastic localization, which arises as the time reversal of coordinatewise binomial thinning. We further establish concentration of measure, maximum-entropy principles, and several closure properties for ultra-log-concave measures, and develop applications to queueing models, polymatroids, antiferromagnetic Potts models, and hardcore models. Finally, a lattice scaling limit of the discrete theory yields Poincaré and Brascamp--Lieb inequalities for Laguerre diffusions.

math.PR↗
arXiv2026

Superdiffusive central limit theorem for a Brownian particle in a critically-correlated incompressible random drift

We consider the long-time behavior of a diffusion process on $\mathbb{R}^d$ advected by a stationary random vector field which is assumed to be divergence-free, dihedrally symmetric in law and have a log-correlated potential. A special case includes $\nabla^\perp$ of the Gaussian free field in two dimensions. We show the variance and the second moment of the displacement at a large time $t$ behave like $2dc_*^{1/2} t (\log t)^{1/2}$, in a quenched sense and with a precisely determined prefactor $c_*=c_*(\mathbb{P})>0$, independent of $ν$. We also prove a quenched invariance principle under this superdiffusive scaling. The proof is based on a rigorous renormalization group argument in which we inductively analyze coarse-grained diffusivities, scale-by-scale. Our analysis leads to sharp homogenization and large-scale regularity estimates on the infinitesimal generator, which are subsequently transferred into quantitative information on the process.

math.PR↗