English

Subcritical Boolean percolation on graphs of bounded degree

Probability 2025-11-25 v3

Abstract

In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and vertices are said to be active independently with probability p[0,1]p \in [0, 1]. We consider WW to be the reunion of random balls with an active center. In certain circumstances, the model does not exhibit a phase transition, in the sense that WW almost surely contains an infinite component for all p>0p > 0, or even WW covers the entire graph. In this paper, we give a sufficient condition on the radius distribution for the existence of a subcritical phase, namely a regime such that almost surely all the connected components of WW are finite. Additionally, we provide a sufficient condition for the exponential decay of the size of a typical component.

Keywords

Cite

@article{arxiv.2410.15722,
  title  = {Subcritical Boolean percolation on graphs of bounded degree},
  author = {Corentin Faipeur},
  journal= {arXiv preprint arXiv:2410.15722},
  year   = {2025}
}

Comments

13 pages, published in ECP. This version includes the corrections described in the erratum of the paper (also published in ECP)

R2 v1 2026-06-28T19:29:14.898Z