We consider the Boolean model with random radii based on Cox point processes. Under a condition of stabilization for the random environment, we establish existence and non-existence of subcritical regimes for the size of the cluster at the origin in terms of volume, diameter and number of points. Further, we prove uniqueness of the infinite cluster for sufficiently connected environments.
We prove the sharpness of the percolation phase transition for a class of Cox percolation models, i.e., models of continuum percolation in a random environment. The key requirements are that the environment has a finite range of dependence and satisfies a local boundedness condition, however the FKG inequality need not hold. The proof combines the OSSS inequality with a coarse-graining construction.
We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation regimes based on the notion of stabilization. Second, we give asymptotic expressions for the percolation probability in large-radius, high-density and coupled regimes. In some regimes, we find universality, whereas in others, a sensitive dependence on the underlying random intensity measure survives.
We consider percolation in a multiscale Boolean model. This model is defined as the union of scaled independent copies of a given Boolean model. The scale factor of the $n^{\textrm{th}}$ copy is $ρ^{-n}$. We prove, under optimal integrability assumptions, that no percolation occurs in the multiscale Boolean model for large enough $ρ$ if the rate of the Boolean model is below some critical value.
We investigate percolation in the Boolean model with convex grains in high dimension. For each dimension d, one fixes a compact, convex and symmetric set K $\subset$ R d with non empty interior. In a first setting, the Boolean model is a reunion of translates of K. In a second setting, the Boolean model is a reunion of translates of K or $ρ$K for a further parameter $ρ$ $\in$ (1, 2). We give the asymptotic behavior of the percolation probability and of the percolation threshold in the two settings.
We study the signal-to-interference ratio (SINR) percolation model for a stationary Cox point process in two or higher dimensions, in case of a bounded and integrable path-loss function. We show that if this function has compact support or if the stationary intensity measure evaluated at a unit box has some exponential moments, then the SINR graph has an infinite connected component in case the spatial density of points is large enough and the interferences are sufficiently reduced (without vanishing). This holds under suitable stabilization and connectivity assumptions on the intensity measur…
We consider a multiscale Boolean percolation on $\mathbb R^d$ with radius distribution $μ$ on $[1,+\infty)$, $d\ge 2$. The model is defined by superposing the original Boolean percolation model with radius distribution $μ$ with a countable number of scaled independent copies. The $n$-th copy is a Boolean percolation with radius distribution $μ|_{[1,κ]}$ rescaled by $κ^{n}$. We prove that under some regularity assumption on $μ$, the subcritical phase of the multiscale model is sharp for $κ$ large enough. Moreover, we prove that the existence of an unbounded connected component depends only on t…
We consider the discrete Boolean model of percolation on graphs satisfying a doubling metric condition. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of percolation, provided that the retention parameter of the underlying point process is small enough. We exhibit three families of interesting graphs where the main result of this work holds. Finally, we give sufficient conditions for ergodicity of the discrete Boolean model of percolation.
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of percolation, provided that the intensity of the underlying point process is small enough. We also study a Harris graphical procedure to construct, forward in time, particle systems with interactions of infinite range under the assumption that the corresponding generator admits a Kalikow-type decomposition. We do so by using the subcriticality of the boolean…
In this work we study the Poisson Boolean model of percolation in locally compact Polish metric spaces and we prove the invariance of subcritical and supercritical phases under mm-quasi-isometries. In other words, we prove that if the Poisson Boolean model of percolation is subcritical or supercritical (or exhibits phase transition) in a metric space M which is mm-quasi-isometric to a metric space N, then these phases also exist for the Poisson Boolean model of percolation in N. Then we apply these results to understand the phenomenon of phase transition in a large family of metric spaces. Ind…
Signal-to-interference plus noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted signal powers of the devices of the network are assumed random, i.i.d. and possibly unbounded. Additionally, we assume that the devices form a stationary Cox point process, i.e., a Poisson point process with stationary random intensity measure, in two or higher dimensions. We present the following main results. First, under suitable moment conditions on the si…
It is well known that there are two regimes in a standard one-dimensional Boolean percolation model: either the entire space is covered a.s., or the covered volume fraction is strictly less than one. The aim of this work is to demonstrate that there is a third possibility in a Boolean model with totally asymmetric grains on a half-line: a.s. there is no unbounded component, but the covered volume fraction is one. An explicit condition is given characterizing the existence of an unbounded occupied component.
We consider Poisson Boolean percolation on $\mathbb R^d$ with power-law distribution on the radius with a finite $d$-moment for $d\ge 2$. We prove that subcritical sharpness occurs for all but a countable number of power-law distributions. This extends the results of Duminil-Copin--Raoufi--Tassion where subcritical sharpness is proved under the assumption that the radii distribution has a $5d-3$ finite moment. Our proofs techniques are different from their paper: we do not use randomized algorithm and rely on specific independence properties of Boolean percolation, inherited from the underlyin…
We consider the Poisson Boolean model of continuum percolation. We show that there is a subcritical phase if and only if $E(R^d)$ is finite, where $R$ denotes the radius of the balls around Poisson points and $d$ denotes the dimension. We also give related results concerning the integrability of the diameter of subcritical clusters.
We establish the mean-field bounds $γ\ge 1$, $δ\ge 2$ and $\triangle \ge 2$ on the critical exponents of the Poisson-Boolean continuum percolation model under a moment condition on the radii; these were previously known only in the special case of fixed radii (in the case of $γ$), or not at all (in the case of $δ$ and $\triangle$). We deduce these as consequences of the mean-field bound $β\le 1$, recently established by Duminil-Copin, Raoufi and Tassion under the same moment condition, using a relative entropy method introduced by the authors in previous work.
We consider the Poisson Boolean percolation model in $\mathbb{R}^2$, where the radii of each ball is independently chosen according to some probability measure with finite second moment. For this model, we show that the two thresholds, for the existence of an unbounded occupied and an unbounded vacant component, coincide. This complements a recent study of the sharpness of the phase transition in Poisson Boolean percolation by the same authors. As a corollary it follows that for Poisson Boolean percolation in $\mathbb{R}^d$, for any $d\ge2$, finite moment of order $d$ is both necessary and suf…
We consider the Boolean model on $\R^d$. We prove some equivalences between subcritical percolation properties. Let us introduce some notations to state one of these equivalences. Let $C$ denote the connected component of the origin in the Boolean model. Let $|C|$ denotes its volume. Let $\ell$ denote the maximal length of a chain of random balls from the origin. Under optimal integrability conditions on the radii, we prove that $E(|C|)$ is finite if and only if there exists $A,B >0$ such that $¶(\ell \ge n) \le Ae^{-Bn}$ for all $n \ge 1$.
We consider a non trivial Boolean model $Σ$ on ${\mathbb R}^d$ for $d\geq 2$. For every $x,y \in {\mathbb R}^d$ we define $T(x,y)$ as the minimum time needed to travel from $x$ to $y$ by a traveler that walks at speed $1$ outside $Σ$ and at infinite speed inside $Σ$. By a standard application of Kingman sub-additive theorem, one easily shows that $T(0,x)$ behaves like $μ\|x\|$ when $\|x\|$ goes to infinity, where $μ$ is a constant named the time constant in classical first passage percolation. In this paper we investigate the positivity of $μ$. More precisely, under an almost optimal moment as…
Recently the study of noise sensitivity and noise stability of Boolean functions has received considerable attention. The purpose of this paper is to extend these notions in a natural way to a different class of perturbations, namely those arising from running the symmetric exclusion process for a short amount of time. In this study, the case of monotone Boolean functions will turn out to be of particular interest. We show that for this class of functions, ordinary noise sensitivity and noise sensitivity with respect to the complete graph exclusion process are equivalent. We also show this equ…
Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model and the Boolean model. Non-percolation of the Boolean model implies the uniqueness of the Gibbs measure and exponential decay of pair correlations and finite volume errors. Hence, lower bounds on the critical intensity for percolation of the Boolean model imply lower bounds on the critical activity for a (potential) phase transition. These lower bounds impr…
Detection, coverage and percolation in dynamic Boolean models with random radii based on $α$-stable processes
School of Mathematics, University of Leeds（利兹大学数学学院）；Technische Universität Braunschweig（布伦瑞克工业大学）；Weierstrass Institute for Applied Analysis and Stochastics（魏尔斯特拉斯应用分析与随机过程研究所）
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of this tessellation are the support of a Cox point process, while the vertices (zero-dimensional facets or simply 0-facets) are the support of a Bernoulli point process. Taking the superposition $Z$ of these two processes, two points of $Z$ are linked by an edge if and only if they are sufficiently close and located on the same edge (1-facet) of the supporting…
We consider percolation properties of the Boolean model generated by a Gibbs point process and balls with deterministic radius. We show that for a large class of Gibbs point processes there exists a critical activity, such that percolation occurs a.s. above criticality. For locally stable Gibbs point processes we show a converse result, i.e. they do not percolate a.s. at low activity.
Given a graph $Γ$, its auxiliary \emph{square-graph} $\square(Γ)$ is the graph whose vertices are the non-edges of $Γ$ and whose edges are the pairs of non-edges which induce a square (i.e., a $4$-cycle) in $Γ$. We determine the threshold edge-probability $p=p_c(n)$ at which the Erd{\H o}s--Rényi random graph $Γ=Γ_{n,p}$ begins to asymptotically almost surely have a square-graph with a connected component whose squares together cover all the vertices of $Γ_{n,p}$. We show $p_c(n)=\sqrt{\sqrt{6}-2}/\sqrt{n}$, a polylogarithmic improvement on earlier bounds on $p_c(n)$ due to Hagen and the autho…
Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and exponential quasi-independence, that ensure the positivity of its time constants, that is almost surely, the pseudo-distance given by $T$ from the origin is asymptotically a norm. Combining this general result with previously known ones, we prove that The known phase transition for Gaussian percolation in the case of fields with positive correlations with exponentiall…
We prove that the Poisson-Boolean percolation on $\mathbb{R}^d$ undergoes a sharp phase transition in any dimension under the assumption that the radius distribution has a $5d-3$ finite moment (in particular we do not assume that the distribution is bounded). More precisely, we prove that: -In the whole subcritical regime, the expected size of the cluster of the origin is finite, and furthermore we obtain bounds for the origin to be connected to distance $n$: when the radius distribution has a finite exponential moment, the probability decays exponentially fast in $n$, and when the radius dist…
For a given dimension d $\ge$ 2 and a finite measure $ν$ on (0, +$\infty$), we consider $ξ$ a Poisson point process on R d x (0, +$\infty$) with intensity measure dc $\otimes$ $ν$ where dc denotes the Lebesgue measure on R d. We consider the Boolean model $Σ$ = $\cup$ (c,r)$\in$$ξ$ B(c, r) where B(c, r) denotes the open ball centered at c with radius r. For every x, y $\in$ R d we define T (x, y) as the minimum time needed to travel from x to y by a traveler that walks at speed 1 outside $Σ$ and at infinite speed inside $Σ$. By a standard application of Kingman sub-additive theorem, one easily…
We are interested in phase transitions in certain percolation models on point processes and their dependence on clustering properties of the point processes. We show that point processes with smaller void probabilities and factorial moment measures than the stationary Poisson point process exhibit non-trivial phase transition in the percolation of some coverage models based on level-sets of additive functionals of the point process. Examples of such point processes are determinantal point processes, some perturbed lattices, and more generally, negatively associated point processes. Examples of…
We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for SINR graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollobás that the bidirectional $k$-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for $k=2$.
We generalise disagreement percolation to Gibbs point processes of balls with varying radii. This allows to establish the uniqueness of the Gibbs measure and exponential decay of pair correlations in the low activity regime by comparison with a sub-critical Boolean model. Applications to the Continuum Random Cluster model and the Quermass-interaction model are presented. At the core of our proof lies an explicit dependent thinning from a Poisson point process to a dominated Gibbs point process.
We consider some continuum percolation models. We are mainly interested in giving some sufficient conditions for absence of percolation. We give some general conditions and then focuse on two examples. The first one is a multiscale percolation model based on the Boolean model. It was introduced by Meester and Roy and subsequently studied by Menshikov, Popov and Vachkovskaia. The second one is based on the stable marriage of Poisson and Lebesgue introduced by Hoffman, Holroyd and Peres and whose percolation properties have been studied by Freire, Popov and Vachkovskaia.
We study percolation properties of the upper invariant measure of the contact process on $\mathbb{Z}^d$. Our main result is a sharp percolation phase transition with exponentially small clusters throughout the subcritical regime and a mean-field lower bound for the infinite cluster density in the supercritical regime. This generalizes and simplifies an earlier result of Van den Berg [Ann. App. Prob., 2011], who proved a sharp percolation phase transition on $\mathbb{Z}^2$. Our proof relies on the OSSS inequality for Boolean functions and is inspired by a series of papers by Duminil-Copin, Raou…
This is the second, and last paper in which we address the behavior of oriented first passage percolation on the hypercube in the limit of large dimensions. We prove here that the extremal process converges to a Cox process with exponential intensity. This entails, in particular, that the first passage time converges weakly to a random shift of the Gumbel distribution. The random shift, which has an explicit, universal distribution related to modified Bessel functions of the second kind, is the sole manifestation of correlations ensuing from the geometry of Euclidean space in infinite dimensio…
Consider a Boolean model $Σ$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $λ$ and the radii of distinct balls are i.i.d.\ with common distribution $ν$. The critical covered volume is the proportion of space covered by $Σ$ when the intensity $λ$ is critical for percolation. Previous numerical simulations and heuristic arguments suggest that the critical covered volume may be minimal when $ν$ is a Dirac measure. In this paper, we prove that it is not the case in sufficiently high dimension.
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $λ,μ$. For any $λ>0$ we consider the percolation threshold $μ_c(λ)$ associated to the parameter $μ$. Denoting by $λ_c:= λ_c(2r)$ the percolation threshold for the standard Poisson Boolean model with radii $r$, we show the lower bound $μ_c(λ)\ge c\log(c/(λ-λ_c))$ for any $λ>λ_c$ with $c>0$ a fixed constant. In particular, $μ_c(λ)$ tends to infinity when $λ$ tends to $λ_c$ from above.
We consider the Poisson Boolean model of continuum percolation on a homogeneous Riemannian manifold $M$. Let $lambda$ be intensity of the Poisson process in the model and let $lambda_u$ be the infimum of the set of intensities that a.s. produce a unique unbounded component. We show that above $λ_u$ there is a.s. a unique unbounded component. We also study what happens at $λ_u$ for some spaces. In particular, if $M$ is the product of the hyperbolic disc and the real line, then at $λ_u$ there is a.s. not a unique unbounded component. The results are inspired by results for Bernoulli bond percola…
The continuum random cluster model is a Gibbs modification of the standard boolean model of intensity $z > 0$ and law of radii $Q$. The formal unormalized density is given by $q^{N_{cc}}$ where $q$ is a fixed parameter and $N_{cc}$ is the number of connected components in the random structure. We prove for a large class of parameters that percolation occurs for $z$ large enough and does not occur for $z$ small enough. An application to the phase transition of the Widom-Rowlinson model with random radii is given. Our main tools are stochastic domination properties, a fine study of the interacti…
Consider a Boolean model $Σ$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $λ$ and the radii of distinct balls are i.i.d.\ with common distribution $ν$. The critical covered volume is the proportion of space covered by $Σ$ when the intensity $λ$ is critical for percolation. Previous numerical simulations and heuristic arguments suggest that the critical covered volume may be minimal when $ν$ is a Dirac measure. In this paper, we prove that it is not the case at least in high dimension. To establish this result we study the asymptotic behaviour, as $d$ t…
Let $\mathcal{H}$ denote a collection of subsets of $\{1,2,\ldots,n\}$, and assign independent random variables uniformly distributed over $[0,1]$ to the $n$ elements. Declare an element $p$-present if its corresponding value is at most $p$. In this paper, we quantify how much the observation of the $r$-present ($r>p$) set of elements affects the probability that the set of $p$-present elements is contained in $\mathcal{H}$. In the context of percolation, we find that this question is closely linked to the near-critical regime. As a consequence, we show that for every $r>1/2$, bond percolation…
It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted majority functions are shown to be noise-stable. Several necessary and sufficient conditions for noise sensitivity and stability are given. Consider, for example, bond percolation on an $n+1$ by $n$ grid. A configuration is a function that assigns to every edge the value 0 or 1. Let $ω$ be a random configur…
In this thesis, I am going to consider Bernoulli percolation on graphs admitting vertex-transitive actions of groups of isometries of d-dimensional hyperbolic spaces H^d. In the first chapter, I give an overview concerning percolation and its terminology. In the separate introduction to each of the other chapters, I explain its contents more precisely, giving also some preliminaries needed therein. In the second chapter, I prove the existence of a non-trivial non-uniqueness phase of Bernoulli percolation on Cayley graphs for a wide class of Coxeter reflection groups of finite type polyhedra in…
We consider a continuum percolation model on $\R^d$, $d\geq 1$.For $t,λ\in (0,\infty)$ and $d\in\{1,2,3\}$, the occupied set is given by the union of independent Brownian paths running up to time $t$ whoseinitial points form a Poisson point process with intensity $λ\textgreater{}0$.When $d\geq 4$, the Brownian paths are replaced by Wiener sausageswith radius $r\textgreater{}0$.We establish that, for $d=1$ and all choices of $t$, no percolation occurs,whereas for $d\geq 2$, there is a non-trivial percolation transitionin $t$, provided $λ$ and $r$ are chosen properly.The last statement means tha…
We consider the Boolean model $Z$ on $\mathbb{R}^d$ with random compact grains, i.e. $Z := \bigcup_{i \in \mathbb{N}} (X_i + Z_i)$ where $η_t := \{X_1, X_2, \dots\}$ is a Poisson point process of intensity $t$ and $(Z_1, Z_2, \dots)$ is an i.i.d. sequence of compact grains (not necessarily balls). We will show, that the volume and diameter of the cluster of a typical grain in $Z$ have an exponential tail if the diameter of the typical grain is a.s. bounded by some constant. To achieve this we adapt the arguments of \cite{duminil2015newproof} and apply a new construction of the cluster of the t…
Proofs of sharp phase transition and noise sensitivity in percolation have been significantly simplified by the use of randomized algorithms, via the OSSS inequality (proved by O'Donnell, Saks, Schramm and Servedio (2005)) and the Schramm-Steif inequality for the Fourier-Walsh coefficients of functions defined on the Boolean hypercube. In this article, we prove intrinsic versions of the OSSS and Schramm-Steif inequalities for functionals of a general Poisson process, and apply these new estimates to deduce sufficient conditions - expressed in terms of randomized stopping sets - yielding sharp …
Consider a family of Boolean models, indexed by integers $n \ge 1$, where the $n$-th model features a Poisson point process in ${\mathbb{R}}^n$ of intensity $e^{n ρ_n}$ with $ρ_n \to ρ$ as $n \to \infty$, and balls of independent and identically distributed radii distributed like $\bar X_n \sqrt{n}$, with $\bar X_n$ satisfying a large deviations principle. It is shown that there exist three deterministic thresholds: $τ_d$ the degree threshold; $τ_p$ the percolation threshold; and $τ_v$ the volume fraction threshold; such that asymptotically as $n$ tends to infinity, in a sense made precise in …
Heuristics indicate that point processes exhibiting clustering of points have larger critical radius $r_c$ for the percolation of their continuum percolation models than spatially homogeneous point processes. It has already been shown, and we reaffirm it in this paper, that the $dcx$ ordering of point processes is suitable to compare their clustering tendencies. Hence, it was tempting to conjecture that $r_c$ is increasing in $dcx$ order. Some numerical evidences support this conjecture for a special class of point processes, called perturbed lattices, which are "toy models" for determinantal …
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 greater than or equal to 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 lambda. In this paper we mainly study the transition between a phase where the random fractal sets are total…
