Search arXivSearch

arXiv · 2311.10498

Scaling of the Cumulative Weights of the Invasion Percolation Cluster on a Branching Process Tree

Abstract

We analyse the scaling of the weights added by invasion percolation on a branching process tree. This process is a paradigm model of self-organised criticality, where criticality is approach without a prespecified parameter. In this paper, we are interested in the invasion percolation cluster (IPC), obtained by performing invasion percolation for $n$ steps and letting $n\to\infty$. The volume scaling of the IPC was discussed in detail in (Gündlach and van der Hofstad 2023) and in this work, we extend this analysis to the scaling of the cumulative weights of the IPC. We assume a power-law offspring distribution on the branching process tree with exponent $α$. In the regimes $α>2$ and $α\in(1,2)$, we observe a natural law-of-large-numbers result, where the cumulative weights have the same scaling as the volume, but converge to a different limit. In the case $α<1$, where the weights added by invasion percolation vanish, the scaling regimes change significantly. For $α\in(1/2,1)$, the weights scale exponentially but with a different parameter than the volume scaling, while for $α\in(0,1/2)$ it turns out that the weights are summable without any scaling. Such a phase transition at $α=1/2$ of the cumulative weights is novel and unexpected as there is no significant change in the neighbourhood scaling of the IPC at $α=1/2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rowel Gündlach. 2023-11-17. Scaling of the Cumulative Weights of the Invasion Percolation Cluster on a Branching Process Tree. https://arxiv.org/abs/2311.10498

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR