Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.11667

Limit theorems for walks and triangles on Erdös-Rényi random graphs with large interaction radius

O. Khorunzhiy
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study cumulants of numbers of $q$-step walks on Erd\H os-Rényi random graphs with distance-dependent edge probability in the limit when the number of vertices $N$, concentration $c$, and interaction radius $R$ tend to infinity. These cumulants can be associated with a formal cumulant expansion of the free energy of matrix models of exponential random graphs widely known in mathematical and theoretical physics. We show that in three different asymptotic regimes, the limiting values of $k$-th cumulants ${\cal F}_k^{(q)}$ exist and can be associated with one or another family of tree-type diagrams, in dependence on the asymptotic behavior of parameters $cR/N$ for $q$-step non-closed walks and $c^2R/N^2$ for 3-step closed walks, respectively. In some cases, we obtain explicit expressions for ${\cal F}_k^{(q)}$ with the help of a modified Prüfer codification. These results allow us to prove Limit Theorems for the number of non-closed walks and for the number of triangles in corresponding ensembles of large random graphs. We indicate an asymptotic threshold that separates the normal probability distribution and the Poisson one for the number of triangles in random graphs. We show that in the random graph ensemble that we consider the average vertex degree can be bounded from above while the total number of triangles infinitely increases, thus rigorously solving a graph collapse problem known in applications.

Explore related subjects

math.PRmath-phmath.COmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

O. Khorunzhiy. 2026-06-04. Limit theorems for walks and triangles on Erdös-Rényi random graphs with large interaction radius. https://arxiv.org/abs/2407.11667

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

KEEP EXPLORING

Related papers

arXiv2026

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR↗
arXiv2026

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR↗
arXiv2026

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR↗