Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1911.09630

A time-invariant random graph with splitting events

Agelos Georgakopoulos·John Haslegrave
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a Poisson random number of edges are added between them. The process is parametrised by a positive real $λ$ which governs the limiting average degree. We show that for each value of $λ$ there is a unique random connected rooted multigraph $M(λ)$ invariant under this evolution. As a consequence, starting from any finite graph $G$ the process will almost surely converge in distribution to $M(λ)$, which does not depend on $G$. We show that this limit has finite expected size. The same process naturally extends to one in which connectedness is not necessarily preserved, and we give a sharp threshold for connectedness of this version. This is an asynchronous version, which is more realistic from the real-world network point of view, of a process we studied in arXiv:1506.02697, arXiv:1703.09011.

Explore related subjects

math.PRmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Agelos Georgakopoulos, John Haslegrave. 2021-09-01. A time-invariant random graph with splitting events. https://doi.org/10.1214/21-ecp436

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

KEEP EXPLORING

Related papers

arXiv2026

Distribution-uniform strong laws of large numbers

We revisit the question of whether the strong law of large numbers (SLLN) holds uniformly in a rich family of distributions, culminating in a distribution-uniform generalization of the Marcinkiewicz-Zygmund SLLN. These results can be viewed as extensions of Chung's distribution-uniform SLLN to random variables with uniformly integrable $q^\text{th}$ absolute central moments for $0 < q < 2$. Furthermore, we show that uniform integrability of the $q^\text{th}$ moment is both sufficient and necessary for the SLLN to hold uniformly at the Marcinkiewicz-Zygmund rate of $n^{1/q - 1}$. These proofs centrally rely on novel distribution-uniform analogues of some familiar almost sure convergence results including the Khintchine-Kolmogorov convergence theorem, Kolmogorov's three-series theorem, a stochastic generalization of Kronecker's lemma, and the Borel-Cantelli lemmas. We also consider the non-identically distributed case.

math.PR↗
arXiv2026

Malliavin Calculus for rough stochastic differential equations

In this work we show that rough stochastic differential equations (RSDEs), as introduced by Friz, Hocquet, and Lê (2021), are Malliavin differentiable. We use this to prove existence of a density when the diffusion coefficients satisfies standard ellipticity assumptions. Moreover, when the coefficients are smooth and the diffusion coefficients satisfies a Hörmander condition, the density is shown to be smooth. The key ingredient is to develop a comprehensive theory of linear rough stochastic differential equations, which could be of independent interest.

math.PR↗
arXiv2026

Nonasymptotic and distribution-uniform Komlós-Major-Tusnády approximation

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Komlós, Major, and Tusnády (KMT) [1975,1976]. The constants appearing in our inequalities are either universal or explicit, and thus as corollaries, they imply distribution-uniform generalizations of the aforementioned KMT approximations. In particular, it is shown that uniform integrability of a random variable's $q^{\text{th}}$ moment is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $o(n^{1/q})$ for $q > 2$ and that having a uniformly lower bounded Sakhanenko parameter -- equivalently, a uniformly upper-bounded Bernstein parameter -- is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $O(\log n)$. Instantiating these uniform results for a single probability space yields the analogous results of KMT exactly.

math.PR↗