Sharpness of phase transition for Voronoi percolation in hyperbolic space
Abstract.
In this paper, we consider Voronoi percolation in the hyperbolic space () and show that the phase transition is sharp. More precisely, we show that for Voronoi percolation with parameter generated by a homogeneous Poisson point process with intensity , there exists such that the probability of a monochromatic path from the origin reaching a distance of decays exponentially fast in . We also prove the mean-field lower bound for .
1. Introduction
Percolation theory was first introduced by Broadbent and Hammersley in [BH57] as a mathematical model for the study of liquids or gas penetrating through porous media. Since then, with a wide range of open questions and many applications in statistical physics, it has received considerable scholarly attention. We refer the reader to [Gri99] and [BR06b] for a general introduction to percolation theory.
The most fundamental question in the study of percolation is the existence of phase transition, that is to say, the sheer difference of the behaviour of the model between subcritical and supercritical regimes. In answering this question, Aizenman and Barsky [AB87] and Menshikov [Men86] gave the first proofs of sharp phase transition for Bernoulli percolation on . More precisely, they showed that there is the exponential decay of the probability of one-arm events in the subcritical regime and the mean-field lower bound in the supercritical phase. Later, more proofs in this direction emerged; see e.g. [Gri99], [DCT16] for more thorough discussion on this matter.
In parallel with the growing understanding of discrete percolation models, many works have been dedicated to the study of continuum percolation, including Poisson boolean model and Voronoi model, where new challenges arise due to spatial dependencies. We refer readers to [MR96] for more on continuum percolation. Recently, more properties concerning continuum model such as noise sensitivity ([ABGM14], [AB18]), sharp phase transition of Poisson boolean model ([ATT18]) and rate of convergence for the crossing probability of quenched Voronoi percolation ([AGMT16], [AdlRG21]) have also been developed.
One of the most important examples of the continuum percolation model is Poisson Voronoi percolation, in which one colours the Voronoi cells generated by a Poisson point process in black with probability and white with probability , independently of the colours of all other Voronoi cells. In [BR06a], Bollobás and Riordan proved that the planar Voronoi percolation undergoes a sharp phase transition at , and the exponential decay of connection probability in subcritical regime in for every was studied in [DCRT19a].
The Voronoi percolation model can also be constructed in the hyperbolic space (see [BS01]). Here, different from the Euclidean case, the intensity of the Poisson point process in does matter, and we denote the law of the random colouring of by . For Voronoi percolation in hyperbolic spaces, Hansen and Müller proved that the critical probability for the existence of an infinite cluster tends to as the intensity of the Poisson point process tends to infinity in [HM21a] and asymptotically equals to as tends to 0 in [HM21b]. In this paper we are going to offer a proof of sharpness of phase transition of Voronoi percolation on . Instead of giving the formal definition here, we first roughly describe our main result of this paper:
Theorem 1.
For and , there exists such that:
1. For every , there exists a constant such that
2. There exists such that for all ,
While extending existing proofs of sharp phase transition for discrete models to this model is not easy, a new approach making use of randomized algorithms and the OSSS inequality introduced in [OSSS05], has been developed in [DCRT19b]. In this work, we also follow the line of [DCRT19a], adapting the arguments to the hyperbolic case.
Finally, let us remark that in [LPY21], the authors offered a new version of the OSSS inequality for functionals of a general Poisson process, providing another plausibly feasible approach of Theorem 1. However, in this paper we still chose to discretize the hyperbolic space and apply the original OSSS inequality as it is enough to provide a concise proof of our main result.
This work is organized as follows: in Section 2 we introduce basic notations and give a few preliminary results that will be used in proof of Theorem 1 which is wrapped up in Section 3
Acknowledgments: The research of the authors is supported by NSFC (No. 12071012) and the National Key R&D Program of China (No. 2020YFA0712900).
2. Notation and preliminaries
2.1. Hyperbolic space
Hyperbolic space (), denoted by , is the maximally symmetric, simply connected, dimensional Riemannian manifold with a constant negative sectional curvature. Typically, people study hyperbolic space by constructing models in order to utilize the Euclidean space to describe the hyperbolic space. In our following arguments, we choose the Poincaré ball model to represent and now we are going to provide a brief summary of its definitions.
The Poincaré ball model can be constructed through equipping the open unit ball with a hyperbolic distance and a metric tensor. Here, represents the Euclidean norm.
For points , the hyperbolic distance is defined by
where is the inverse function of hyperbolic sine.
The metric tensor in the Poincaré ball model is
In this paper we will consider both Euclidean balls and hyperbolic balls, and thus in the following context we will use subscripts to distinguish them. For example, we use and respectively to represent the hyperbolic ball and the Euclidean ball centered at with radius . Similarly, the hyperbolic sphere centered at with radius is denoted by . Also notice that every hyperbolic sphere centered at the origin is also an Euclidean sphere centered at the origin. More precisely,
And we denote the hyperbolic annulus centered at the origin with inner radius and outer radius while containing the inner boundary by
For a countable set of points in the hyperbolic plane, we denote the corresponding hyperbolic Voronoi cell of by
2.2. Hyperbolic Poisson point process and Voronoi percolation
A homogeneous Poisson point process with constant intensity on can be viewed as an inhomogeneous Poisson point process on the ordinary Euclidean space with intensity
A gentle introduction to point process and Poisson point process can be found in [LP17] and in the rest of this paper we will usually use to denote a homogeneous Poisson point process with constant intensity on .
After presenting the definition of Poisson point process on , we attach to each point in a randomly chosen colour independently. Precisely, every point in is coloured black with probability and white with probability , and the colours of different points in are independent. By using (resp. ) to denote the black points (resp. white points) after the colouring process, we can also view and as independent Poisson point processes on with respective intensities and . Let denote the law of , or equivalently the law of with its colours, then the measure induces a colouring of the hyperbolic space defined as follows:
From now on we will use for when it does not cause misunderstanding since we are going to prove Theorem 1 for every fixed .
For , let denote the event that there exists a continuous path of black points connecting to , and let denotes the event that the origin belongs to a infinite-volume connected component of black points. For two subsets and of , we use to denote , and briefly write for . Also for , , , define
Then we can abbreviate as and as .
2.3. Increasing events and the FKG inequality
An event is said to be if for every configurations and ,
An event is said to be if its complement is increasing.
As in Bernoulli percolation model, we also have FKG inequality for Voronoi percolation in listed in the following context. We will avoid the proof and refer the reader to [BR06b, Chapter 8] for more information about this lemma.
Lemma 1 ([BR06b],Lemma 14).
Let and be two increasing events. Then for any , ,
(1) |
2.4. A Russo-type formula
For an increasing event and a configuration , we define the set of by
And define an increasing event if there exists such that is measurable with respect to the -field generated by .
Lemma 2.
The function is differentiable if is a local increasing event and
(2) |
The main idea of this lemma can be seen in [[DCRT19a], Lemma 4]. Here, we supplement the details for the proof of the integrability of and the continuity of which is not mentioned in the former paper.
Proof of Lemma 2.
We denote the law of by d and write
Notice that when is given, the law of is Bernoulli percolation with parameter on all points of . Assume that only depends on the -field generated by for a fixed . Then we can apply Russo’s formula for Bernoulli percolation([Gri99, Section 2.4]) to get the differentiability of with respect to and
Therefore, combining Fubini’s gives
Therefore, it suffices to explain that is integrable and that is continuous with respect to .
For the former question, let denote the set of points in whose cells intersect the ball . Then the locality of implies
(3) |
First notice that by standard estimates of the Poisson-Voronoi tessellation, there exists such that for every ,
(4) |
As for the second part, notice that once we prove the continuity of and , , the continuity of with respect to then follows from the uniform convergence of
For every fixed , for every , using the integrability of we can choose large and such that when ,
Similarly, we can derive the continuity of for every , and therefore conclude that is continuous with respect to .
∎
2.5. The OSSS inequality
The OSSS inequality was introduced in [OSSS05] and states that for a given boolean function and a randomized algorithm determining , the variance of this boolean function can be controlled by the revealments of each coordinate during the process of and the influences of coordinates.
Assume that is a countable set, is a product probability space and is a function mapping to . A decision tree determining is an algorithm that takes as an input, and reveals the coordinates of step by step based on the values of revealed so far. The algorithm stops when the possible values of no longer depend on the values of the coordinates of that have not been revealed.
The revealment of the -th coordinate is defined by
and the influence of the -th coordinate is given by
where represents the random element in which is the same as in every coordinate while has the -th coordinate resampled independently.
The OSSS inequality is stated as follows.
Lemma 3 (OSSS).
For any function and any algorithm determining , which stops in finite steps almost surely, we have
(5) |
3. Proofs
3.1. Discretization of Voronoi percolation
Before turning back to the proof of our main theorem, we first introduce an appropriate product space to encode the measure of Voronoi percolation on the Poincaré disk model so that we are able to use Lemma 3. Here, to present the idea clearly, we will only focus on the case for . And as for higher dimensions, using the polar coordinate to denote the volume of a measurable set and cutting the angles appropriately just like what we are going to do for , we can also derive Lemma 4 and give the proof of the main theorem.
First note that for and every measurable subset , the area is given by
Now we are going to divide the hyperbolic space up into countable disjoint hyperbolic annuli centered at the origin and cut each annulus into several sectors while making sure that the areas of these sectors are uniformly bounded.
Precisely, for a given , we first regard as unions of annuli of the form , . Define . For each , we then divide into annulus sectors of the form
while making sure that each two of these sectors are disjoint and congruent.
Therefore, there exists a determined constant such that for every and each ,
In order to denote annulus sectors clearly, we introduce the definition of representative points:
-
(1)
For , let be the representative point of the degenerate annulus .
-
(2)
For , define the representative point of as the exact point satisfying . And denote the representative points contained in by , .
Let be the set of all representative points, i.e., Then for every annulus sector , there exists a unique representative point, say, contained in this annulus sector. We then denote this region by for simplicity.
For every , define
Let be the space associated with the random variable , and it is obvious that the random variable are independent for different . Then the product space agrees with the original space and we will thus use to denote the probability measure for the product space.
For every and every increasing event , we define
where has law , and is a random variable which equals to except on coordinate which is resampled independently.
Lemma 4.
For every local increasing event ,
(6) |
Proof of Lemma 4.
For a fixed local increasing event , we assume only depends on colours in . First we prove that for any ,
For a fixed , every , observe that leads to and . Combining with the definition of Poisson point process we get that with probability , contains more than one point, then
Summing this inequality over all points which belongs to for every gives
Taking the and using Lemma 2 leads to
Since the inequality holds for all , we can take and derive an estimate for the influence of points in .
For every , if , must have at least one point in , and there exists at least one point in with its cell intersecting , i.e., . Therefore, combining (4) and independence of Poisson point process in disjoint regions implies
Here, is a constant not depending on . The proof then follows from summing over all and letting go to zero. ∎
3.2. Construction of the algorithm
Based on the space introduced in Section 3.1, we are now going to construct an algorithm determining with its revealment having the following upper bound.
Lemma 5.
There exists a constant only depending on and such that for any , we can find an algorithm determining such that
(7) |
Proof.
We first define an auxiliary algorithm helping us reveal the colour of .
The idea of the algorithm is to check the random variables near the fixed point until the colour of every point in is known. To put it precisely, we first set a parameter . When ( is a positive integer), if the colour of all points inside are determined, the algorithm terminates and returns the colours of points in as the output of . Otherwise, the algorithm checks the value of for and set
And the algorithm is constructed as follows:
Set , and use to include the set of points we may need to check.
At every step , assume that and have been determined. Let . If , the algorithm terminates. If , pick and the algorithm runs the following steps:
-
(1)
Run .
-
(2)
Define .
-
(3)
Let
-
(4)
Set Here, denote those black points in the first steps which are not discovered to be connected to until the step runs.
-
(5)
Set
where represents those black points in the first steps that, based on what are revealed now, we cannot determine whether they are connected to .
The algorithm clearly determines since it actually reveals all the black connected components of in . Furthermore, every auxiliary algorithm only needs to discover finite points almost surely due to the integrability of , therefore the algorithm will terminate in a finite time.
And we only need to prove the desired inequality (7), which is trivial for since those points will never be discovered in . For , if is revealed during the process, there exists such that . For every representative point we can first fix a satisfying . Then is revealed during the process implies .
Combining Lemma 1 and we have
Denote , then for every , the constructed algorithm satisfies ∎
3.3. Proof of Theorem 1
Before proving Theorem 1, we first introduce a lemma that converts the proof of Theorem 1 to showing a family of differential inequalities.
Lemma 6.
Consider a converging sequence of increasing differential function such that for all ,
where .
Then, there exists such that:
1. For any , there exists such that for any large ,
2. For any , let , then .
The proof of this lemma can be found in [[DCRT19a], Lemma 3.1].
Proof of Theorem 1.
By Lemma 6, it suffices to show that for every , there exists such that , ,
(8) |
Indeed, combining the fact that [[BS01], Theorem 1.5], the result follows from applying Lemma 6 to and .
Now let , is an algorithm determining the function , applying the OSSS inequality (5) then leads to
(9) |
For every , , it is easy to see that
(10) |
Summing the above inequality from to and dividing by gives
(11) |
We also have
(12) |
Taking , using (11), (12) and (6), we then have for all
which corresponds to the form of inequality (8) and therefore concludes the proof.
∎
References
- [AB87] Michael Aizenman and David J. Barsky. Sharpness of the phase transition in percolation models. Communications in Mathematical Physics, 108(3):489–526, 1987.
- [AB18] Daniel Ahlberg and Rangel Baldasso. Noise sensitivity and voronoi percolation. Electronic Journal of Probability, 23:1–21, 2018.
- [ABGM14] Daniel Ahlberg, Erik Broman, Simon Griffiths, and Robert Morris. Noise sensitivity in continuum percolation. Israel Journal of Mathematics, 201(2):847–899, 2014.
- [AdlRG21] Daniel Ahlberg, Daniel de la Riva, and Simon Griffiths. On the rate of convergence in quenched voronoi percolation. arXiv:2103.01870, 2021.
- [AGMT16] Daniel Ahlberg, Simon Griffiths, Robert Morris, and Vincent Tassion. Quenched voronoi percolation. Advances in Mathematics, 286:889–911, 2016.
- [ATT18] Daniel Ahlberg, Vincent Tassion, and Augusto Teixeira. Sharpness of the phase transition for continuum percolation in . Probability Theory and Related Fields, 172(1):525–581, 2018.
- [BH57] Simon R Broadbent and John M Hammersley. Percolation processes: I. crystals and mazes. In Mathematical proceedings of the Cambridge philosophical society, volume 53, pages 629–641. Cambridge University Press, 1957.
- [BR06a] Béla Bollobás and Oliver Riordan. The critical probability for random voronoi percolation in the plane is 1/2. Probability theory and related fields, 136(3):417–468, 2006.
- [BR06b] Béla Bollobás and Oliver Riordan. Percolation. Cambridge University Press, 2006.
- [BS01] Itai Benjamini and Oded Schramm. Percolation in the hyperbolic plane. Journal of the American Mathematical Society, 14(2):487–507, 2001.
- [DCRT19a] Hugo Duminil-Copin, Aran Raoufi, and Vincent Tassion. Exponential decay of connection probabilities for subcritical voronoi percolation in . Probability Theory and Related Fields, 173(1-2):479–490, 2019.
- [DCRT19b] Hugo Duminil-Copin, Aran Raoufi, and Vincent Tassion. Sharp phase transition for the random-cluster and potts models via decision trees. Annals of Mathematics, 189(1):75–99, 2019.
- [DCT16] Hugo Duminil-Copin and Vincent Tassion. A new proof of the sharpness of the phase transition for bernoulli percolation and the ising model. Communications in Mathematical Physics, 343(2):725–745, 2016.
- [Gri99] Geoffrey Grimmett. Percolation. Springer Berlin Heidelberg, 1999.
- [HM21a] Benjamin T Hansen and Tobias Müller. The critical probability for voronoi percolation in the hyperbolic plane tends to . Random Structures Algorithms, 2021.
- [HM21b] Benjamin T. Hansen and Tobias Müller. Poisson-voronoi percolation in the hyperbolic plane with small intensities, 2021.
- [LP17] Günter Last and Mathew Penrose. Lectures on the Poisson process, volume 7. Cambridge University Press, 2017.
- [LPY21] Günter Last, Giovanni Peccati, and D. Yogeshwaran. Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees. arXiv:2103.01870, 2021.
- [Men86] Mikhail V Menshikov. Coincidence of critical points in percolation problems. In Soviet Mathematics Doklady, volume 33, pages 856–859, 1986.
- [MR96] Ronald Meester and Rahul Roy. Continuum Percolation. Cambridge University Press, 1996.
- [OSSS05] Ryan O’Donnell, Mike Saks, Oded Schramm, and Rocco Servedio. Every decision tree has an influential variable. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS), 2005.