Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Subcritical Boolean percolation on graphs of bounded degree (2410.15722v2)

Published 21 Oct 2024 in math.PR

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 \in [0, 1]$. We consider $W$ 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 $W$ almost surely contains an infinite component for all $p > 0$, or even $W$ 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 $W$ are finite. Additionally, we provide a sufficient condition for the exponential decay of the size of a typical component.

Citations (1)

Summary

We haven't generated a summary for this paper yet.