The growth of the infinite long-range percolation cluster
Pieter Trapman

TL;DR
This paper studies how the size of the neighborhood around a point in an infinite long-range percolation model grows, revealing different regimes of growth depending on the connection probability decay function.
Contribution
It characterizes the asymptotic growth rates of the percolation cluster in terms of regularly varying connection functions, extending understanding of spatial percolation behavior.
Findings
Growth rate can be exponential, bounded, or linear depending on the decay function.
Identifies regimes where the cluster size's exponential growth rate converges to different limits.
Provides insights applicable to spatial epidemic models, especially for the basic reproduction number.
Abstract
We consider long-range percolation on , where the probability that two vertices at distance are connected by an edge is given by and the presence or absence of different edges are independent. Here, is a strictly positive, nonincreasing, regularly varying function. We investigate the asymptotic growth of the size of the -ball around the origin, , that is, the number of vertices that are within graph-distance of the origin, for , for different . We show that conditioned on the origin being in the (unique) infinite cluster, nonempty classes of nonincreasing regularly varying exist, for which, respectively: almost surely; there exist such that $\lim_{k\to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
