Phase Transition and Uniqueness of Levelset Percolation

The main purpose of this paper is to introduce and establish basic results of a natural extension of the classical Boolean percolation model (also known as the Gilbert disc model). We replace the balls of that model by a positive non-increasing attenuation function l:(0,∞)→[0,∞)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l:(0,\infty ) \rightarrow [0,\infty )$$\end{document} to create the random field Ψ(y)=∑x∈ηl(|x-y|),\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi (y)=\sum _{x\in \eta }l(|x-y|),$$\end{document} where η\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta $$\end{document} is a homogeneous Poisson process in Rd.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {R}}^d.$$\end{document} The field Ψ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi $$\end{document} is then a random potential field with infinite range dependencies whenever the support of the function l is unbounded. In particular, we study the level sets Ψ≥h(y)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi _{\ge h}(y)$$\end{document} containing the points y∈Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$y\in {\mathbb {R}}^d$$\end{document} such that Ψ(y)≥h.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi (y)\ge h.$$\end{document} In the case where l has unbounded support, we give, for any d≥2,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d\ge 2,$$\end{document} a necessary and sufficient condition on l for Ψ≥h(y)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi _{\ge h}(y)$$\end{document} to have a percolative phase transition as a function of h. We also prove that when l is continuous then so is Ψ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi $$\end{document} almost surely. Moreover, in this case and for d=2,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d=2,$$\end{document} we prove uniqueness of the infinite component of Ψ≥h\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Psi _{\ge h}$$\end{document} when such exists, and we also show that the so-called percolation function is continuous below the critical value hc\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h_c$$\end{document}.


Introduction
In the classical Boolean continuum percolation model (see [14] for an overview), one considers a homogeneous Poisson process η of rate λ > 0 in R d , and around each point x ∈ η one places a ball B(x, r ) of radius r. The main object of study is then which is referred to as the occupied set. It is well known (see [14,Chap. 3]) that there exists an r c = r c (d) ∈ (0, ∞) such that It is also well known that P(C(r ) contains an unbounded component) ∈ {0, 1}. An immediate scaling argument shows that varying λ is equivalent to varying r, and so one can fix λ = 1. This model was introduce by Gilbert in [8] and further studied in [2,3,15,17] (to name a few), while a dynamical version of this model was studied in [1]. We consider a natural extension of this model. Let η be a Poisson process with rate λ in R d , and let x ∈ η denote a point in this process (here we use the standard abuse of notation by writing x ∈ η instead of x ∈ supp(η)). Furthermore, let l : (0, ∞) → [0, ∞) be a nonincreasing function that we will call the attenuation function. We then define the random field = (l, η) at any point y ∈ R d by (1. 2) In order for this to be well defined at every point, we let l(0) := lim r →0 l(r ) (which can possibly be infinite). One can think of as a random potential field where the contribution from a single point x ∈ η is determined by the function l. For any 0 < h < ∞, we define ≥h := {y ∈ R d : (y) ≥ h}, which is simply the part of the random field which is at or above the level h. Sometimes we also need >h := {y ∈ R d : (y) > h}.
We note that if we consider our general model with l(|x|) = I (|x| ≤ r ) (where I is an indicator function), we have that C and ≥1 have the same distribution, so the Boolean percolation model can be regarded as a special case of our more general model.
When l has unbounded support, adding or removing a single point of η will affect the field at every point of R d . Thus, our model does not have a so-called finite energy condition which is the key to many standard proofs in percolation theory. This is what makes studying challenging (and in our opinion interesting). However, if we assume that l has bounded support, a version of finite energy is recovered (see also the remark in Sect. 4 after the proof of our uniqueness result, Theorem 1.4).
It is easy to see that varying h and varying λ is not equivalent. However, we will nevertheless restrict our attention to the case λ = 1. In fact, there are many different sub-cases and generalizations that can be studied. For instance: We can let λ ∈ R, we can study l having bounded or unbounded support, we can let l be a bounded or unbounded function, let l be continuous or discontinuous and we can study ≥h or >h , to name a few possibilities. While some results (Theorems 2.3 and 2.1) include all or most of the cases listed, others (Proposition 3.1 and Theorems 1.4 and 1.5) require more specialized proofs. The purpose of this paper is not to handle all different cases. If l has bounded support, then our model is very similar to the classical Boolean percolation model, and therefore we will (unless otherwise stated) throughout make the following assumption. Assumption 1. 1 The attenuation function l is non-increasing and has unbounded support.
The assumption of l being non-increasing is certainly not necessary for most of our results. However, this assumption is very convenient and removes the need for overly technical statements. Se the last remark after the statement of Theorem 1.3. In addition to Assumption 1.1, we will also always assume that d ≥ 2.
We will now proceed to state our main results, but first we have the following natural definition. Definition 1. 2 If ≥h ( >h ) contains an unbounded connected component, we say that percolates at (above) level h, or simply that ≥h ( >h ) percolates.
One would of course expect that percolation occurs either with probability 0 or with probability 1, and indeed this can be proven through classical ergodicity arguments. Therefore, it is natural to define h c := sup{h : ≥h percolates with probability 1}.
If we defineh c as above, but with ≥h replaced by >h , then h c =h c . Indeed,h c ≤ h c is clear. Conversely, if h < h c then for h < h < h c we have that ≥h percolates. Hence >h percolates and h ≤h c .
One of the main efforts of this paper is to establish conditions under which h c is nontrivial.

Theorem 1.3 With l as in Assumption
Remark • The choice of the lower integral boundary 1 in ∞ 1 r d−1 l(r )dr is somewhat arbitrary, as replacing it with ∞ c r d−1 l(r )dr for any 0 < c < ∞, would give the same result.
• As we shall see in the proof of Theorem 1.3, if • Mere a.s. finiteness of the field does not guarantee that there is a nontrivial phase transition. Indeed, one can construct an example (following the examples of [14,Chap. 7.7]) of a stationary process together with a suitable attenuation function so that the ensuing field is finite a.s., while h c = ∞. • The result is qualitatively different when l has bounded support, see Theorem 2.3.
• Consider briefly the non-monotone attenuation function l(r ) = |r − 1| −d . Obviously, we then have that ∞ 1 r d−1 l(r )dr = ∞. However, the tail behaviour of l is such that a suitably modified version of Theorem 1.3 would still hold for this case. This is the main reason for including non-increasingness in Assumption 1.1.
We have the following uniqueness result. The rest of the paper is organized as follows. In Sect. 2 we prove Theorem 1.3 along with some related secondary results. In Sect. 3 we prove the continuity of the field whenever l is continuous, and this results is then used in Sect. 4 in order to prove Theorem 1.4. In turn, Theorem 1.4 allows us to prove Theorem 1.5 which is also done in Sect. 4.

Proof of Theorem 1.3.
The proof of Theorem 1.3 is naturally divided into two parts (h c > 0 and h c < ∞ respectively). For completeness, we will briefly consider attenuation functions of (possibly) bounded support. Thus, let r l := sup{r : l(r ) > 0} and recall the definition of r c .
Remark As is clear from the proof, the gap when r l = r c for d ≥ 3, is simply due to the fact that for d ≥ 3 it is unknown whether P(C(r c ) contains an unbounded component) is 0 (as when d = 2) or 1.
Proof of Theorem 2.1 Recall the constructions (1.1) and (1.2). Observe that by using the same realization of η, we can couple and C on the same probability space in the canonical way. By using this coupling, we see that for any h > 0, ≥h ⊂ C(r l ). In the case d = 2, it is known (see [14,Theorem 4.5]) that C(r c ) does not percolate, showing that h c = 0 when d = 2 and r l ≤ r c . For d ≥ 3, the statement follows by observing that C(r ) does not percolate for r < r c by definition of r c .
Assume instead that r l > r c . Let r c < r < r l , and h = h(r ) be any h such that With this choice of h, we see that any point y within radius r from some x ∈ η will also belong to ≥h so that Since r > r c , C(r ) a.s. contains an unbounded component and hence so does ≥h .
We will make frequent use of the following theorem, both of whose statements are sometimes called "Campbell's formula". Theorem 2.2 Let η be a (possibly non-homogeneous) Poisson process on R d with intensity measure μ. Then we have that for any g(x) : R d → [0, ∞) such that x∈η g(x) converges a.s., (2.1) Furthermore, we have that For a proof of Theorem 2.2 we refer the reader to [11] page 28 or [5,Chaps. 5.5,9.4 and 9.5].
We now return to Theorem 1.3, which will be proved once we have established the following result. Remark Note also that if l has bounded support, we must have that ∞ 1 r d−1 l(r )dr < ∞. As will be clear, the proof in fact also covers this case.

Theorem 2.3 If the attenuation function l satisfies
The proof of Theorem 2.3 is much more involved than the proof of Theorem 2.1, and will require a number of preliminary lemmas to be established first. In order to see what the purpose of these will be, we will start by giving an outline of the strategy of our proof along with introducing some of the relevant notation. Let αZ d denote the lattice with spacing α > 0. For any z ∈ αZ d , let B(z, α) denote the closed box of side length α centered at z, and define B α := {B(z, α) : z ∈ αZ d }. For convenience, we assume from now on that α < 1.
Claim There exists an > 0 such that if for fixed 0 < α < 1 and 0 < h < ∞ we have that for every k and every collection B 1 , . . . , B k ∈ B α , then ≥h does a.s. not contain an unbounded component.
Of course, whether the condition (2.3) of the claim actually holds, will depend on the specific choice of α and h.
This claim can be proved using standard percolation arguments as follows. Let B o ∈ B α be the cube containing the origin o and let O denote the event that B o intersects an unbounded component of ≥h . If O occurs, then for any k, there must exist a sequence B 1 , B 2 , . . . B k ∈ B α such that B 1 = B o , B i = B j for every i = j, B i ∩ B i+1 = ∅ for every i = 1, . . . , k − 1 and with the property that sup y∈B i (y) ≥ h for every i = 1, . . . , k. We note that the number of such paths must be bounded by 3 dk , as any box has fewer than 3 d 'neighbors'. Thus, from (2.3) we get that P(O) ≤ 3 dk k , and since this holds for arbitrary k this proves the claim by taking < 3 −d .
One issue when proving (2.3) is that we want to consider the supremum of the field within the boxes B 1 , . . . , B k . However, this is fairly easily dealt with by introducing an auxiliary field˜ with the property that for any B ∈ B α˜ (y c (B)) ≥ sup y∈B (y) where y c (B) denotes the center of B (see further (2.9)). This allows us to consider k fixed points of the new field˜ rather than the supremums involved in (2.3).
One of the main problems in proving (2.3) is the long range dependencies involved whenever l has unbounded support (as discussed in the introduction). The strategy to resolve this issue is based on the simple observation that The event on the right hand side of (2.4) can be analyzed through the use of (2.2). An obvious problem with this is that if l is unbounded and if a single point of η falls in k l=1 B l , then the sum in (2.4) is infinite. However, by letting α above be very small, we can make sure that with very high probability, "most" of the boxes B 1 , . . . , B k will not contain any points of η (and in fact there will not even be a point in a certain neighborhood of the box). We then use a more sophisticated version of (2.4) (i.e. (2.10)) where we condition on which of the boxes B 1 , . . . , B k have a point of η in their neighborhood, and then sum only over the boxes whose neighborhoods are vacant of points. This in turn introduces another problem, namely that we now have to deal with a Poisson process conditioned on the presence and absence of points of η in the neighborhoods of the boxes B 1 , . . . , B k . In particular, we have to control the damage from knowing the presence of such points. This is the purpose of Lemmas 2.4 and 2.5, which will tell us that our knowledge is not worse than having no information at all plus adding a few extra points to the process. Later, Lemma 2.6 will enable us to control the effect of this addition of extra points.
We now start presenting the rigorous proofs. Our first lemma is elementary, and the result is presumably folklore. However, we give a proof for sake of completeness.

Lemma 2.4
Let X be a Poisson distributed random variable with parameter λ. We have that for any k ≥ 0, Proof We claim that for any X n ∼ Bin(n, p) where np = λ, and any 0 ≤ k ≤ n, we have that We observe that from (2.6) we get that This establishes (2.5), and so we need to prove (2.6). We will prove (2.6) through induction, and we start by observing that it trivially holds for n = 1 and k = 0, 1. Assume therefore that (2.6) holds for n and any k = 0, . . . , n. We will write X n = X 1 +· · ·+ X n where (X i ) i≥1 is an i.i.d. sequence with P(X i = 1) = 1−P(X i = 0) = p. Of course, (2.6) trivially holds for n + 1 and k = 0. Furthermore, we have that for any k = 1, . . . , n, where we use the induction hypothesis that P(X n ≥ k|X n ≥ 1) ≤ P(X n ≥ k − 1) in the last inequality. Finally, and this establishes (2.6) for n + 1 and any k = 0, . . . , n + 1.
In what follows, we shall deal with a number of different point processes η, ξ, . . . on R d , both Poisson and other. We will primarily view these as (random) counting measures on R d so that for instance η(A) is the number of points of η in the set A ⊂ R d . However, we will sometimes use a standard abuse of notation by identifying η with its support. For instance, η ⊂ ξ simply means that the support of η is a subset of the support of ξ, or (somewhat more informally) a point in η is also a point in ξ.
Let A 1 , A 2 , . . . , A n be subsets of R d , and let C 1 , . . . , C m be a partition of ∪ n i=1 A i such that for any i, for some collection , and let η A be a homogeneous (unconditioned) Poisson process of rate λ > 0 on ∪ n i=1 A i . Furthermore, let ξ A be a point process on ∪ n i=1 A i consisting of exactly one point in each of the sets C 1 , . . . , C m such that the position of the point in C i is uniformly distributed within the set, and so that this position is independent between sets.
Our next step is to use Lemma 2.4 to prove a result relating the conditioned Poisson process η A to the sum η A + ξ A , where η A and ξ A are independent. For two point processes η 1 , η 2 in R d , we write η 1 η 2 if there exists a coupling of η 1 , η 2 so that P(η 1 ⊂ η 2 ) = 1.

Lemma 2.5 Let η A , η A and ξ A be as above, and let η A and ξ A be independent. We have that
Remark Informally, Lemma 2.5 tells us that if we consider a homogeneous Poisson process conditioned on the presence of points in A 1 , . . . , A k , it is not worse than taking an unconditioned process and adding single points to all the sets C 1 , . . . , C m (which are used as the building blocks for the sets A 1 , . . . , A k ).
Proof of Lemma 2. 5 We shall prove the lemma by giving an explicit coupling. We do this by simultaneously constructing two point-processesη 1 andη 2 in such a way thatη 1 ⊂η 2 . We will then proceed to prove thatη 1 has the same distribution as η A whileη 2 has the same distribution as η A + ξ A . Furthermore, we will assume thatη 1 andη 2 are point processes on n i=1 A i , since outside this set the processes η A , η A are simply homogeneous Poisson processes and so we can take them to be equal there. Of course, ξ A has no points outside of In what follows, we will let J = ( j 1 , . . . , j m ) ∈ {0, 1} m , and for any point process ξ, we let L(ξ ) ∈ {0, 1} m be such that L j (ξ ) = 1 iff ξ(C j ) ≥ 1. Thus, L(ξ ) tells us which of the sets C 1 , . . . , C m that are empty. As usual, η denotes a homogeneous Poisson process in R d .
For the coupling construction we will use the auxiliary random variables (U l ) m l=1 which are independent and U ([0, 1]) distributed. We will also use the sequences (V l,k ) ∞ k=1 where l = 1, . . . , m. These random variables are taken to be mutually independent and also independent of (U l ) m l=1 . The random variables (V l,k ) ∞ k=1 are uniformly distributed on the set C l . We start by constructingη 1 : Step 2: Given that the result of Step 1 was that where k l = 1, 2, . . . Step 3: Given the numbers Y 1 , . . . , Y m from step 2, we let the restriction ofη 1 We proceed by constructingη 2 : Step 1 : where again k l = 1, 2, . . .
Step 2 : Given the numbers Z 1 , . . . , Z m from step 2, we let the restriction ofη 2 to C l be , and therefore we have that Z l ≥ Y l . We conclude that for every l, Y l ≤ Z l . Finally, since we are using the same random variables (V l,k ) ∞ k=1 in Step 3 and Step 2 we conclude that indeedη 1 ⊂η 2 .
What remains is to verify the distributions ofη 1 ,η 2 and we start withη 1 . We say that Then, we have that for any sequence k 1 , . . . , k m The last equality follows since the conditioning L(η) = J , involves conditioning on events concerning the disjoint sets C 1 , . . . , C m . Turning toη 1 , we let β l,k l := P(η(C l ) ≥ k l |η(C l ) ≥ 1) and note that Furthermore, we observe that for J not admissible, Therefore, we have that where we use Step 1, Step 2, the independence of the U l and finally (2.8) in the four equalities. We conclude that for every k 1 , . . . , k m we have that The fact that η A andη 1 are equal in distribution follows since conditioned on the event . . , C m are independent and uniform within their corresponding set C l . To see this, let ξ |C l denote the restriction of a point process ξ to the set C l , and let A l denote an event measurable with respect to ξ |C l . We then have that for where we use the independence property of Poisson processes on disjoint sets. Forη 2 , a straightforward calculation shows that for every k 1 , . . . , k m , from which the statement easily follows.
We now turn to the issue of taking the supremum of the field over a box. Therefore, let 0 < α < 1, and define the auxiliary attenuation functionl α bỹ for every r ≥ 0. If y c (B) denotes the center of the box B ∈ B α , we note that for any y ∈ B and x ∈ R d , Therefore, if we let˜ be the field we get by usingl in place of l in (1.2), we get that Our next lemma will be a central ingredient of the proof of Theorem 2.3. It will deal with the effect to the field˜ of adding extra points to η. To that end, let A o be the box of side length α(4 at the closest distance to the origin, and let ξ denote the corresponding (deterministic) point set. Let˜ be the corresponding deterministic field. Lemma 2.6 Let l satisfy Assumption 1.1 and ∞ 1 r d−1 l(r )dr < ∞. Then, there exists a constant C < ∞ depending on d but not on α and such that for every 0 < α < 1, where the constant C = C(d) < ∞ is allowed to vary in the steps of the calculations. Finally, the fact that I α < ∞, follows easily from the fact that ∞ 1 r d−1 l(r )dr < ∞.
We have now established all necessary tools in order to prove Theorem 2.3. However, since the proofs of the two statements of Theorem 2.3 are very different, we start by proving the first one as a separate result. Proof We shall prove that for any > 0, (2.3) holds for α small enough and h large enough. This will prove our result as explained just below (2.3).
For any B ∈ B α , let A be the box concentric to B and with side length α(4 √ d + 1). We will say that a box B is good if η(A) = 0, and observe that P(η(A) = 0) → 1 as α → 0. Goodness of the boxes B ∈ B α naturally induces a percolation model on Z d with a finite range dependency. Since the marginal probability P(η(A) = 0) of being good can be made to be arbitrarily close to 1 by taking α small enough, we can use the results in [12] (see also Theorem B26 of [13]) to let the induced "goodness-process" dominate an i.i.d. product measure with density p = p(α) on the boxes B ∈ B α . That is, Furthermore, by the same theorem, we can take p(α) → 1 as α → 0.
Fix k, a collection of distinct cubes B 1 , B 2 , . . . , B k ∈ B α , and let 1} k be such that K j (η) = 1 iff B j is good, and identify K (η) with the corresponding subset of {1, . . . , k}. Thus we write j ∈ K (η) iff B j is good. We then have that by using (2.9) in the first inequality.
If we take = |{(B i ) k i=1 : B i is good}|, then by the above domination of a product measure of density p, we see that is stochastically larger than ∼Bin( p, k). Therefore, we have that where we can take d(α) → ∞ as α → 0, by taking p(α) → 1. For any J ∈ {0, 1} k , we let η J be a Poisson process on R d of rate 1, conditioned on the event K (η) = J. Furthermore, for j ∈ J c , let We see that η J can be expressed as the sum ofη and η D whereη is a Poisson process on R d \ k n=1 A n of unit rate, while η D is a Poisson process on j∈J c D j conditioned on the event j∈J c {η(D j ) ≥ 1}. We let C 1 , . . . , C m ∈ B α be a partition (up to sets of measure zero) of j∈J c D j , and use Lemma 2.5 to see that η D η D + ξ D . Here of course, η D is Poisson process on j∈J c D j while ξ D is a point process consisting of one point added uniformly and independently to every box C i for i = 1, . . . , m. As in Lemma 2.5 η D and ξ D are independent (Fig. 1). We conclude that η J = η D +η η D + ξ D +η, and observe that η D +η is just a homogeneous Poisson process on R d \A J where A J := j∈J A j . Writing η A c J for this sum, we have that η J ξ D + η A c J and by first using this, and then Markov's inequality, we get that where P ξ D +η A c J is the probability measure corresponding to ξ D + η A c J , and where E ξ D +η A c J denotes expectation with respect to this probability measure. We havẽ using obvious notation. Thus, using independence, we have that E ξ D e s j∈J˜ ξ D (y c (B j )) .

By (2.2) we get that
since the intensity measure for η A c J is simply 0 on A J and Lebesgue measure outside of A J . We proceed by bounding the right hand side of this expression and start by noting that for so that by Lemma 2.6, g J (x) is uniformly bounded by C I α /α d where C I α < ∞ is as in that lemma. We can therefore use that e x − 1 ≤ 2x for x ≤ 1, to see that for 0 < s ≤ α d /(C I α ), we have e sg J (x) − 1 ≤ 2sg J (x). Hence, where by using that the side length of A(B j ) is α(4 √ d + 1), we have that as in the proof of Lemma 2.6. Using (2.15) in (2.14), we get that We now turn to the second factor on the right hand side of (2.13). Observe that for any k, J ∈ {0, 1} k and j ∈ J we have that

Using Lemma 2.6, it follows that
(2.17) Using (2.16) and (2.17), with (2.13) we see from (2.12) that Inserting this into (2.10), and using (2.11), we get Then, by setting s = α d /(C I α ) (i.e. the largest possible s in order to use (2.15)) we get that Finally, by first letting α be so small that e −d(α) ≤ /2, and then taking h large enough, (2.3) follows.
We will now prove Theorem 2.3 in its entirety.

Proof of Theorem 2.3
The first statement is simply Theorem 2.7 and so we turn to the second statement. Consider the auxiliary attenuation function l (r ) := l(r + 1), and let denote the corresponding random field. We observe that for any y ∈ B(o, 1) and x ∈ R d , l (|x|) = l(|x| + 1) ≤ l(|x − y| − |y| + 1) ≤ l(|x − y|), so that We proceed to show that P( (o) = ∞) = 1, since then it follows that P inf y∈R d (y) = ∞ = 1 by a standard countability argument. Therefore, let A 0 := B(o, 1), and A k := B(o, k + 1)\B(o, k) and note that V ol ( For any X ∼ Poi(λ), a standard Chernoff type bound yields for some c > 0. Therefore, P(A c k ) ≤ e −cdκ d k d−1 so that P(A c k i.o.) = 0 by the Borell-Cantelli lemma. Thus, for a.e. η, there exists a K = K (η) < ∞, so that A k occurs for every k ≥ K . Furthermore, we have that if A k occurs, then for any k ≥ 3, Therefore we get that by letting K ≥ 3,

Continuity of the Field
In this section, we turn to the everywhere continuity of the field . This result will then be of use when proving Theorem 1.4. Of course, if l is not continuous, everywhere continuity of cannot hold. However, if l is continuous then everywhere continuity of the field would be expected. We note that in the case of l being unbounded (i.e. lim r →0 l(r ) = ∞), we simply define (y) = ∞ for every y ∈ η. (3.1) We will proceed by bounding the two terms on the right hand side of (3.1). Consider therefore the second term Furthermore, we have that for any > 0, where we use (2.2) in the equality and the fact that the intensity measure of η(D c n ) is Lebesgue measure outside of D n . We also use the integrability assumption ∞ 0 r d−1 l(r )dr < ∞ (which follows from ∞ 1 r d−1 l(r )dr < ∞ and l being bounded) when taking the limit. By combining (3.2) and (3.3), we see that by taking n large enough, the second term of (3.1) is smaller than α.
For the first term, we get that Since D n is bounded, we have that for any x ∈ D n , . Therefore, for any fixed n, the right hand side of (3.4) is smaller than α for δ small enough. We conclude that for any , α > 0, there exists δ > 0, small enough so that We now turn to the case where l is unbounded. Then, for any M < ∞, we let l M (r ) = min(l(r ), M), and define M (y) to be the random field obtained by using l M instead of l. If we let we see that M (y) = (y) for every y ∈ R d \ ∪ x∈η B M (x). By the first case, M (y) is continuous everywhere, and so (y) is continuous for any y ∈ R d \∪ x∈η B M (x). Since M < ∞ was arbitrary, the statement follows after observing that lim y→x (y) = ∞ whenever x ∈ η.

Uniqueness
In this section we restrict ourselves to d = 2. We will first consider the case of >h , and then explain how the second case of Theorem 1.4 quickly follows from it. For convenience we formulate the following separate statement.

Theorem 4.1 Let h be such that >h contains an unbounded component. If l is continuous and with unbounded support, then for d = 2, there is a unique such unbounded component.
Our strategy will be to adapt the argument in [7] which proves uniqueness for a class of models on Z d . In order to perform this adaptation it is much easier to work with arcwise connectedness rather than connectedness. The reason for this is that we can easily form new arcs from intersecting arcs, while the corresponding result for connectedness is rather challenging topologically.
However, in our continuous context, we have defined percolation in terms of connectedness, as is usually done. But, since is a.s. continuous by Proposition 3.1, the set >h is a.s. an open set. For open sets, connected and arcwise connected are the same thing, as is well known. Hence, if x and y are in the same connected component of >h , then there is a continuous curve from x to y in >h . This observation makes >h easier to study than ≥h directly, and is the reason for proving Theorem 4.1 separately.
In the sequel we try to balance between the fact that we do not want or need to repeat the whole argument of [7] on the one hand, and the need to explain in detail what changes are to be made and what these changes constitute on the other hand.
In [7], uniqueness of the infinite cluster in two-dimensional discrete site percolation is proved under four conditions. Consider a probability measure μ on {0, 1} Z 2 and let ω ∈ {0, 1} Z 2 be a configuration. If ω(x) = 1 we call x ∈ Z 2 open and if ω(x) = 0 we call it closed. The four conditions which together imply uniqueness of the infinite open component are: In our context, conditions analogous to Conditions 1 and 2 clearly hold. Some care is needed for Condition 3 though. We will say that an event E is increasing if a configuration in E remains in E if we add additional points to the point process η (and adapt the field accordingly). Furthermore, E is decreasing if E c is increasing. With these definitions, one can prove the analogue of the FKG inequality as in the proof of Theorem 2.2 in [14].
Condition 4 is natural in the discrete context. Indeed, if the probability that the origin is in an infinite cluster is 0, then by translation invariance, no infinite cluster can exist a.s. The case in which the probability that the origin is in an infinite cluster is 1 was excluded only for convenience, and this assumption is not used in the proof in [7]. In our continuous context, we need to be slightly more careful. Suppose that >h contains an unbounded component with positive probability. Since >h is an open set by continuity of the field, any such unbounded component must be open as well. Hence there must be an > 0 and an x ∈ R 2 so that B(x, ) is contained in an infinite component with positive probability, since a countable collection of such balls covers the plane. By translation invariance, the same must then be true for any x ∈ R 2 . Hence, any point x ∈ R 2 is contained in an infinite component with positive probability, and Condition 4 holds.
Gandolfi, Keane and Russo prove uniqueness by showing that there exists a δ > 0 such that any box B n = [−n, n] 2 is surrounded by an open path with probability at least δ. Hence the probability that all such boxes are surrounded by an open path is at least δ, and since the latter event is translation invariant it must have probability one. This ensures uniqueness, as is well known since 1960, see [10]. For the proof of Theorem 4.1, we can in principle follow the structure of their argument, with a number of modifications, as follows.

Proof of Theorem 4.1 For any set
The first step is to show that it is impossible to have percolation in a horizontal strip Q M of the form and similarly for vertical strips. In their case this claim simply follows from the fact that closed sites exist (by virtue of Condition 4) and then it follows from Condition 3 that there is a positive probability that a strip is blocked completely by closed sites. Finally, ergodicity (or rather stationarity) shows that a strip is blocked infinitely many times in either direction.
Since we work in a continuous setting, this argument does not go through immediately. However, we can adapt it to our context. To this end, consider the set C = C(N , , that is, a vertical "strip" in Q M . Since the field is a.s. finite, by deleting points one by one from η, say in increasing order with respect to distance to C, we have that upon deleting these points, C ↓ 0. Hence, after deleting sufficiently many points it must be the case that C < h, for any given h > 0. If we let D o (L) denote the event that the contribution of points outside the box B L to C is at most h, we conclude that for some (random) number L, D o (L) occurs. It then follows that for some deterministic L 0 , P(D o (L 0 )) > 0. Note also that D o (L 0 ) only depends on the points of η outside B L 0 .
Let D i (L 0 ) denote the event that there are no points of η in B L 0 itself. Then P(D i (L 0 )) > 0 and by independence of D i (L 0 ) and D o (L 0 ), it also follows that P(D i (L 0 ) ∩ D o (L 0 )) > 0. Furthermore, on the event D i (L 0 ) ∩ D o (L 0 ), we have that C < h, and we conclude that for any h > 0 there is positive probability that the field does not exceed h on C. So any vertical strip in C(N , M) ⊂ Q M has positive probability to satisfy C < h and by stationarity there must be infinitely many of such strips in both directions. So there can not be percolation in Q M .
Having established this, we now turn to the second step of the argument. As mentioned above, in [7], they construct open paths whose union, by virtue of their specific construction, surround a given box. They show that for any given box, such a construction can be carried out with a uniform positive probability. It is at this point of the argument that two-dimensionality is crucial as the two-dimensional topology forces certain paths to intersect.
The remainder of the proof of uniqueness proceeds in two steps. First we prove uniqueness under the assumption that the half-plane H + := {(x, y); y ≥ 0} percolates. After that, we prove uniqueness under the assumption that H + does not percolate.
For  + (0, N ). Finally, letẼ N := E(0, ∞, H + \D N ) and observe that whileẼ N is clearly increasing in η, the event D N ≤ h is decreasing in η. Therefore, by the FKG inequality we have that Since our system is mixing (see e.g. [14, p. 26] plus the fact that the field is a deterministic function of the Poisson process), we have that lim N →∞ P(E ∩ D N ≤ h ) = P(E)P( D ≤ h). It follows that when N → ∞, P(Ẽ N ) → P(E). In words, if percolation occurs from the origin in H + with positive probability, then the conditional probability that there is an unbounded path avoiding D N tends to 1 as N → ∞.
Hence, if the probability that y −N : Finally, we consider the case in which the half space does not percolate. We can modify the argument in [7] similarly and we do not spell out all details. In the first case we showed that if we have percolation from the origin in H + , the conditional probability that there is an unbounded path avoiding D N tends to 1 as N → ∞. In this second case it turns out that we need to show that this remains true if we in addition also want to avoid D −N . For this, the usual mixing property that we used above, does not suffice, and a version of 3-mixing is necessary. As in [7], we use Theorem 4.11 in [6] for this, in which it is shown that ordinary weak mixing implies 3-mixing along a sequence of density 1. Since our system is weakly mixing, this application of Theorem 4.11 in [6] is somewhat simpler than in [7], but other than that our argument is the same, and we do not repeat it here.
Finally we show how Theorem 4.1 implies Theorem 1.4.
Proof of Theorem 1. 4 We first claim that >h percolates with probability one if and only if ≥h percolates with probability one. The "only if" is clear, since >h ⊂ ≥h . Next, suppose that ≥h percolates with probability one. By definition, this implies that ≥h a.s. contains an unbounded connected component. Let us denote this event by C h . Let A be a bounded region with positive area. Since the probability of C h is 1, it must be the case that where η(A) is (as usual) the number of points of the Poisson process in A. Since we can sample from the conditional distribution of the process given η(A) = 0 by first sampling unconditionally and then simply remove all points in A, it follows that we cannot destroy the event of percolation by removing all points in A.
Hence if we take all points out from A, the resulting field A , say, will be such that A ≥h percolates a.s. But if η(A) > 0, then it is the case that A ≥h ⊆ >h , and it is precisely here we assume that the attenuation function l has unbounded support. Hence, with positive probability we have that >h percolates, and by ergodicity this implies that >h contains an infinite component a.s.
We can now quickly finish the proof. Suppose that ≥h percolates. Then, as we just saw, also >h percolates. Hence we can apply the proof of Theorem 4.1, and conclude that >h does contain continuous curves around each box. Since ≥h is an even larger set, the same must be true for ≥h and uniqueness for this latter set follows as before.
In light of Theorem 1.4, it is of course natural to expect that uniqueness should hold also for d ≥ 3. The classical argument for uniqueness in various lattice models and continuum percolation consists of two parts. Below we examine these separately.
Let N h be the number of unbounded components in ≥h . Following the arguments of [16] (which is for the lattice case but can easily be adapted to the setting of Boolean percolation, see [14] Proposition 3.3) one starts by observing that P(N h = k) = 1 for some k ∈ {0, 1, . . .} ∪ {∞}. Assume for instance that P(N h = 3) = 1, and proceed by taking a box [−n, n] d large enough so that at least two of these infinite components intersect the box with positive probability. Then, glue these two components together by the use of a finite energy argument. That is, turn all sites in the box to state 1 in the discrete case, or add balls to the box in the Boolean percolation case. In this way, we reduce N h by (at least) 1, showing that P(N h = 3) < 1, a contradiction. If one attempts to repeat this procedure in our setting (with the support of l being unbounded), one finds that by adding points to the field, the gluing of two infinite components might at the same time result in the forming of a completely new infinite component somewhere outside the box. Therefore, one cannot conclude that P(N h = 3) < 1.
The second difficulty occurs when attempting to rule out the possibility that P(N h = ∞) = 1. For the Boolean percolation model one uses an argument by Burton and Keane in [4], adapted to the case of Boolean percolation (see [14] proof of Theorem 3.6). However this argument hinges on the trivial but crucial fact that for this model any unbounded component must contain infinitely many points of the Poisson process η. This is not the case in our setting. An unbounded component can in principle contain only a finite number of points of η, or indeed none at all.
We now turn to the last result of this paper, Theorem 1.5. In order to prove continuity, we will give separate arguments for left-and right-continuity. The strategy to prove rightcontinuity will be similar to the corresponding result (i.e. left-continuity) for discrete lattice percolation (see [9,Sect. 8.3]). However, while the other case is trivial for discrete percolation, this is where most of the effort in proving Theorem 1.5 lies. Before giving the full proof, we will need to establish two lemmas that will be used to prove left-continuity. See also the remark after the end of the proof of Theorem 1.5.
Remark Although we choose to state and prove this only for d = 2, a version of this lemma obviously holds for all d ≥ 1.
We are now ready to give the proof of our last result.
Let n be any integer and take Let η 1 n = η + δ V n where V n ∼U(B n ) and observe that since l has unbounded support, η 1 n ∈ {C o,> (h) is unbounded}. Using Lemma 4.3 we get that It remains to prove that lim g↓h θ > (g) = θ > (h), (4.9) for h < h c , and we will use a similar approach as above. We note that lim g↓h P(C o,> (g) is unbounded) = P(C o,> (g) is unbounded for some g > h). (4.10) Assume that C o,> (h) contains an unbounded component, and consider any h < g < h c .
Since >g also must contain an unbounded component I g , and since by Theorem 1.4 we know that this is unique, we conclude that I g ⊂ C o,> (h). As above, C o,> (h) is an open set, and therefore arcwise connected. Thus, for z ∈ I g , there exists a continuous function φ : [0, 1] → R 2 such that φ(0) = o and φ(1) = z. Since φ is continuous, Im(φ) is compact, and so inf t∈[0,1] (φ(t)) is obtained, since is continuous by Proposition 3.1. Furthermore, since Im(φ) ⊂ C o,> (h), we conclude that inf t∈[0,1] (φ(t)) > h. Therefore, for some h < g < h c we also have that inf t∈[0,1] (φ(t)) > g , and so C o,> (g ) contains an unbounded component. We conclude that P(C o,> (g) is unbounded for some g > h) = P(C o,> (h) is unbounded). (4.11) Combining Eqs. (4.10) and (4.11) we conclude that (4.9) holds. In order to complete the proof, we simply observe that for any g < h we have that θ > (h) ≤ θ ≥ (h) ≤ θ > (g) so that Remark Consider the event {o ↔ ∂ B n }, that the origin is connected to the boundary of B n . In the discrete case, it is trivial that P p (o ↔ ∂ B n ) is continuous as a function of the percolation parameter p, since it is an event that depends on the state of only finitely many edges. This then gives an easy proof of right-continuity (corresponding to left-continuity in our case). In our model, points of η at any distance contribute to the field in B n . Therefore, we cannot claim immediate continuity of P(o ↔ ∂ B n ), although our methods above can be used to prove it.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.