Universal behavior of connectivity properties in fractal percolation models

Erik I. Broman, Federico Camia

Research output: Contribution to journalArticlepeer-review


Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d ≥ 2. These include a scale invariant version of the classical (Poisson) Boolean model of stochastic geometry and (for d = 2) the Brownian loop soup introduced by Lawler and Werner. The models lead to random fractal sets whose connectivity properties depend on a parameter λ. In this paper we mainly study the transition between a phase where the random fractal sets are totally disconnected and a phase where they contain connected components larger than one point. In particular, we show that there are connected components larger than one point at the unique value of λ that separates the two phases (called the critical point). We prove that such a behavior occurs also in Mandelbrot’s fractal percolation in all dimensions d ≥ 2. Our results show that it is a generic feature, independent of the dimension or the precise definition of the model, and is essentially a consequence of scale invariance alone. Furthermore, for d = 2 we prove that the presence of connected components larger than one point implies the presence of a unique, unbounded, connected component .

Original languageEnglish (US)
Pages (from-to)1394-1414
Number of pages21
JournalElectronic Journal of Probability
StatePublished - Jan 1 2010


  • Brownian loop soup
  • Continuum percolation
  • Crossing probability
  • Discontinuity
  • Fractal percolation
  • Mandelbrot percolation
  • Phase transition
  • Poisson Boolean Model
  • Random fractals

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Universal behavior of connectivity properties in fractal percolation models'. Together they form a unique fingerprint.

Cite this