SearcharxivSearch

arXiv · 0901.0661

The growth of the infinite long-range percolation cluster

Abstract

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are independent. Here, $\lambda(r)$ is a strictly positive, nonincreasing, regularly varying function. We investigate the asymptotic growth of the size of the $k$-ball around the origin, $|\mathcal{B}_k|$, that is, the number of vertices that are within graph-distance $k$ of the origin, for $k\to\infty$, for different $\lambda(r)$. We show that conditioned on the origin being in the (unique) infinite cluster, nonempty classes of nonincreasing regularly varying $\lambda(r)$ exist, for which, respectively: $\bullet$ $|\mathcal{B}_k|^{1/k}\to\infty$ almost surely; $\bullet$ there exist $1<a_1<a_2<\infty$ such that $\lim_{k\to \infty}\mathbb{P}(a_1<|\mathcal{B}_k|^{1/k}<a_2)=1$; $\bullet$ $|\mathcal{B}_k|^{1/k}\to1$ almost surely. This result can be applied to spatial SIR epidemics. In particular, regimes are identified for which the basic reproduction number, $R_0$, which is an important quantity for epidemics in unstructured populations, has a useful counterpart in spatial epidemics.

Explore related subjects

Keep this discovery

BibTeXRIS

Pieter Trapman. 2009-01-06. The growth of the infinite long-range percolation cluster. https://doi.org/10.1214/09-aop517

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