Dimensions of harmonic measures in percolation clusters on hyperbolic groups
Abstract.
For the simple random walks in percolation clusters on hyperbolic groups, we show that the associated harmonic measures are exact dimensional and their Hausdorff dimensions are equal to the entropy over the speed. Our method is inspired by cluster relations introduced by Gaboriau and applies to a large class of random environments on the groups.
2020 Mathematics Subject Classification:
32V051. Introduction
1.1. Background and main results
A random walk on a word hyperbolic group determines the hitting measure on the Gromov boundary if it has positive speed (cf. [Kai00]). This hitting measure is called the harmonic measure of the random walk. One of the main subjects in the study of such harmonic measures is to establish properties called exact dimensionality and the dimension formula. Let us explain about these terms. In the rest of this section, denotes a nonelementary hyperbolic group, and denotes its Cayley graph with respect to some generating set of . For a Borel measure on the boundary , its upper Hausdorff dimension is defined by
where “” indicates the essential supremum with respect to , and denotes the ball centered at with radius . Informally speaking, it shows the degree of the fractalness of . We say that a harmonic measure is exact dimensional if
holds for -almost every . Further, we say that satisfies the dimension formula if is equal to , where and are the entropy and the speed of the random walk that determines , respectively (see Section 2 for the definition). It has been proved that the harmonic measure of a random walk driven by a single measure on is exact dimensional and satisfies the dimension formula, under several types of conditions [Led01], [LP07], [BHM11], [Tan19]. Such results can be used to show that the harmonic measure is singular to another measure on the boundary defined geometrically (see [LP07], [BHM11], and [CLP21]).
On the other hand, there are only a few works concerning harmonic measures associated with random walks in random environments. Lyons, Pemantle, and Peres showed that the harmonic measure of the simple random walk on a supercritical Galton-Watson tree is exact dimensional and satisfies the dimension formula in their influential paper [LPP95]. The notable work that inspires our study is the paper by Kaimanovich [Kai98], where he established the exact dimensionality and the dimension formula for a large class of Markov chains on trees, and it can be applied to random walks in stationary random environments on free groups.
Our main result is a generalization of results in [Kai98]. Namely, we establish exact dimensionality and the dimension formula for random walks in percolation clusters and random conductance models on hyperbolic groups. Here we focus on percolation clusters for simplicity. For , the Bernoulli percolation is defined as the random subgraph of obtained by independently retaining or deleting each edge with probability or , respectively. The Bernoulli percolation is called supercritical if -almost every has a connected component with infinite vertices. For supercritical , we consider the simple random walk on the connected component of containing the identity (denoted by ), conditioned on being infinite. Note that the event of being infinite, denoted by , is -positive since is supercritical and -invariant. Benjamini, Lyons, and Schramm initiated the study of such random walks in percolation clusters on general Cayley graphs in [BLS99]. They proved that the entropy and the speed (denoted by and , respectively) of such random walks are deterministic, i.e., they depend only on . Further, they showed that if the group is nonamenable. Therefore, for supercritical on , we can define the harmonic measure associated with the simple random walk on for -almost every (recall that every nonelementary hyperbolic group is nonamenable). Based on the ergodic-theoretic approach in [BLS99], we establish the exact dimensionality and the dimension formula for the simple random walks in supercritical Bernoulli percolation clusters.
Theorem 1.1.
Let be a supercritical Bernoulli percolation on . Then, for -almost every , letting be the harmonic measure on determined by the simple random walk on starting from 1, we have
for -almost every . In particular, is positive and constant for -almost every .
In fact, our strategy works for a more general class of percolation models on , as follows.
Theorem 1.2.
Let be an ergodic -invariant percolation on having indistinguishable infinite clusters. Assume that the simple random walk on has positive speed for -almost every . Then, for -almost every , letting be the harmonic measure on determined by the simple random walk on starting from 1, we have
for -almost every . In particular, is positive and constant for -almost every .
We refer to Section 5 for the precise definitions of the terms appearing in this theorem. Note that Benjamini, Lyons, and Schramm gave some sufficient conditions for positive speed in [BLS99], and hence Theorem 1.2 can be applied to various models (see Theorem 5.6). For example, every ergodic invariant percolation with a unique infinite cluster satisfies the assumptions in our theorem.
1.2. Outline of the proof
Let us give an overview of the proof of Theorem 1.2. First, the upper bound,
for -almost every , follows from Kaimanovich’s argument for trees (Theorem 1.4.1 of [Kai98]). The difficulty arises in the proof of the lower bound, i.e.,
for -almost every . We first prove that, for every , the set defined by
is positive with respect to the measure on given by . This part follows the proof of Theorem 3.3 in [Tan19], where a similar claim was shown for random walks driven by a single measure. Tanaka [Tan19] proved that the harmonic measure determined by the random walk driven by a single measure with finite first moment is exact dimensional and satisfies the dimension formula. In his proof, the ergodicity of the -action on was used to prove that the subset of defined analogously to is conull, and it completes the proof of the lower bound in his setting.
In our setting, to prove that is conull, the first attempt should be to consider the diagonal action on , instead of the boundary action. However, since is not -invariant, we cannot do this naively. Instead, we define a subrelation of the orbit equivalence relation of the diagonal action, inspired by cluster relations in [Gab05], so that we can prove that the ergodicity of the relation and show that is invariant under the relation. Combining the ergodicity and the invariance with the positivity of , we complete the proof. Such an argument is quite simple but has not appeared in the literature. In fact, in the case of free groups [Kai98], the lower bound can be shown for essentially arbitrary random walk with positive speed in general, and hence such an argument involving the ergodicity on the boundary does not appear.
1.3. Related works and applications
Among hyperbolic groups, cocompact Fuchsian groups have been well studied in the context of percolation theory. They are closely connected to periodic tilings of the hyperbolic plane . Carrasco, Lessa, and Paquette developed the theory of a general class of random walks on metric spaces called distance stationary sequences and applied it to the simple random walks in percolation clusters on cocompact Fuchsian groups in [CLP21]. In particular, they gave an explicit lower bound for the speed of such random walk in terms of the corresponding hyperbolic tiling. Combining our dimension formula with their estimate, we can show the dimension drop of the harmonic measures. This generalizes their Theorem 4 in [CLP21]. More precisely, for the pair of positive integers and with , let be the regular tiling of by -gons with interior angles and be the pair of the cocompact Fuchsian group and its generating set corresponding to . Let be the Cayley graph associated with , which is the dual graph obtained from . We consider the metric on induced from the standard hyperbolic metric of .
Theorem 1.3.
Let be the graph defined as above, and denote a supercritical Bernoulli percolation on with . Then, the harmonic measures determined by are exact dimensional and satisfy the dimension formula with respect to , and the dimension is a constant, denoted by , for -almost every . Further, we have
uniformly in .
A natural question arising from our result is about the behavior of the dimension of the harmonic measures determined by the Bernoulli percolation when the parameter varies. In [Lal01], Lalley treated the limit sets of percolation clusters on the boundary and proved that its Hausdorff dimension is continuous in the parameter . Then, it is natural to ask if similar properties also hold for the dimension of the harmonic measures. Our result reduces the continuity of to the continuity of the entropy and the speed. The latter question seems more tractable; we leave it open.
Harmonic measures are also studied in the context of random discretizations of the hyperbolic plane. Angel, Hutchcroft, Nachmias, and Ray studied the simple random walks on unimodular random triangulations of the hyperbolic plane (such as the Poisson-Delaunay triangulations) in [AHNR16], and show that the associated harmonic measures have full support and no atom. Our method applies to this setting, and we will treat it in our next paper.
1.4. Organization of the paper
In Section 2, we review some definitions and basic properties concerning word hyperbolic groups, random walks on them, and Hausdorff dimensions of measures. In Section 3, we show two estimates for general Markov chains with positive speed. In Section 4, we first treat invariant random conductance models with the uniform elliptic condition, where the arguments are simpler than that for invariant percolations. In Section 5, we develop ergodic theory of invariant percolations and use it to prove the exact dimensionality and the dimension formula. In Section 6, we present an application to cocompact Fuchsian groups and hyperbolic tilings. In Section 7, we propose some questions naturally arising from our results. In Appendix A, we give the proof of Theorem 5.5. Although such results are standard and well known to experts, we give the detailed proof for the completeness.
Acknowledgements
The author would like to thank Yoshikata Kida and Ryokichi Tanaka for their supports and helpful comments. This research was supported by FoPM, WINGS Program, the University of Tokyo.
2. Preliminaries
2.1. Geometry of word hyperbolic groups
Let us start with the definition of hyperbolicity in the sense of Gromov [Gro87].
Definition 2.1 (-hyperbolicity).
Let be a proper metric space. For , we define the Gromov product of over by
Let be a non-negative number. We say that is -hyperbolic if
for all . We say that is hyperbolic if it is -hyperbolic for some .
We focus on hyperbolic Cayley graphs. Throughout this paper, we always assume that a finite generating set of a group is symmetric and .
Definition 2.2 (Hyperbolic groups).
Let be a finitely generated group. We say that is hyperbolic if there exists a finite generating set of such that the Cayley graph associated with is hyperbolic with respect to the graph metric . A hyperbolic group is called elementary if it is finite or virtually . We always take as the base point of and define for .
In the rest of this section, denotes a nonelementary hyperbolic group and denotes its Cayley graph with respect to some generating set of . Note that such is nonamenable.
Let us define the boundary of . For , denotes the Gromov product of and over .
Definition 2.3 (Gromov boundary).
Let be a hyperbolic Cayley graph endowed with the graph metric. We define the boundary as follows:
-
•
The set is the quotient of the set of geodesic rays starting from by identifying two rays when they are within a bounded distance.
-
•
The quasi-metric on is defined by , where is defined by
Here, denotes the set of geodesic rays from represent .
Although is not a genuine metric, for every small , there exists a genuine metric satisfying
where is a constant depending only on .
The fact that is not a genuine metric has no effect on the argument concerning the Hausdorff dimension. Then we only treat for simplicity.
For the -action on , we have the following estimate.
Lemma 2.4 (Lemma 2.2 in [Tan19]).
Let . Then there exists such that
for every and .
Let us introduce the shadow of on the boundary.
Definition 2.5.
Let and . We define the shadow of by
We have the following comparison between shadows and balls.
Lemma 2.6 (Proposition 2.1 in [BHM11]).
There exist and such that
if and is on a geodesic ray from to .
2.2. Hausdorff dimensions of measures
Definition 2.7 (Hausdorff dimensions of measures).
Let be a Borel probability measure on . We define the (upper) Hausdorff dimension of by
where denotes the Hausdorff dimension of with respect to the quasi-metric .
We have the following characterization of the dimension.
Lemma 2.8.
Let be a Borel probability measure on the boundary . Then the Hausdorff dimension of can be characterized as follows:
where “” indicates the essential supremum with respect to , and is the ball of radius centered at with respect to the quasi-metric .
Proof.
See Section 1.3 in [Kai98], for example. ∎
Definition 2.9 (Exact dimensionality).
Let be a Borel probability measure on . We say that is exact dimensional if the limit
exists for -almost every and it is constant -almost everywhere. Note that if is exact dimensional then the above limit is equal to by Lemma 2.8.
2.3. Regular Markov chains on hyperbolic groups
We review some basic properties of nearest neighbor random walks on . We always assume that Markov chains are nearest neighbor, defined on a hyperbolic Cayley graph , and starting from .
Definition 2.10 (Regular Markov chains).
Let be a nearest neighbor Markov kernel on and be the corresponding Markov chain starting from . Let be the distribution of sample paths of , which is a probability measure on . We say that is regular if there exist reals satisfying the following:
-
•
for -almost every . Here denotes the -step transition probability of .
-
•
for -almost every .
The limits are called the entropy and the speed of , respectively.
We will show that if is a Markov chain determined by invariant random conductance model or invariant percolation then it is regular and the entropy and the speed are both positive. See Theorem 4.4 and Theorem 5.6 for precise statements.
The following result is fundamental in the study of random walks on hyperbolic groups, shown by Kaimanovich in [Kai00].
Theorem 2.11 (Section 7 of [Kai00]).
Let be a regular Markov chain on a non-elementary hyperbolic group . Then for -almost every , it converges to a point in . More precisely, for -almost every sample path , there exists a unit speed geodesic ray such that
where is the speed of .
This property is often called the geodesic tracking property. By this theorem, the boundary map is well-defined for almost every sample path and written as . The harmonic measure of is defined as .
3. General Estimates for Dimensions
The goal of this section is to prove the following two general estimates. Note that both of them have already been shown for random walks driven by a single measure on hyperbolic groups in [LP07] and [Tan19], respectively. Let denote a nonelementary -hyperbolic group and denote its Cayley graph.
Theorem 3.1.
Let be a regular and nearest neighbor Markov chain having positive speed on . Then, for -almost every , we have
where and denote the entropy and the speed of , respectively. In particular, .
Theorem 3.2.
Let be a regular and nearest neighbor Markov chain having positive speed on . Then, for every , the following subset is -positive:
Proof of Theorem 3.1..
We follow Section 2 in [LP07]. Let denote the probability on defined as the distribution of . For and , we define the set
Then, for each , there exists such that by the regularity of . Let denote this . We first show that the limit
exists for almost every . This follows from the Markov property of . Indeed, for , we have
by the martingale convergence theorem, where tail denotes the projection to the tail boundary. We define . Then, we have
and hence . Recall that for , there exists such that
for every . Then, for , we have
by combining the above estimates. Since can be taken arbitrarily and , this implies
for -almost every . We also have by Lemma 2.8. ∎
Next, we give the proof of Theorem 3.2, following Theorem 3.3 in [Tan19]. In the proof, we consider the conditional measures associated with the factor map . More explicitly, that is a family of probability measures on such that
Proof of Theorem 3.2..
It is enough to prove that there exists a -positive set such that
for -almost every . Indeed, for such , we have by the definition of Hausdorff dimensions and Lemma 2.8. Then, by Lemma 2.8, it implies that is positive. In the rest of the proof, we construct such . First, we define as follows:
for and . Then, for every , there exists such that by regularity of and Theorem 2.11. Let and . Then we can estimate the size of as follows:
and hence . Let and , where is the constant in Lemma 2.6. For , we define as . Then, by Lemma 3.6 in [Tan19] (note that the assumption is used here), there exists such that for all and , belongs to the ball if . Therefore, we have
for every . The last inequality follows from the construction of . Then we have
where is the degree of . From this inequality, we obtain
Further, by applying Lemma 2.6 to , which is on a geodesic ray from to , we have
and hence
since and are positive constants.
Finally, for , we obtain
from the above estimates. Since the sequence gives an exhaustion of modulo null sets, we conclude that satisfies the desired property. ∎
4. Invariant Random Conductance Models
In this section, we consider uniformly elliptic random conductance models. They can be seen as bounded random perturbations of , and the proof of the exact dimensionality is simpler than the case of percolation clusters. Readers interested in percolation can skip this section.
4.1. Ergodic Theory of Random Conductance Models
Definition 4.1 (-invariant random conductance models).
Let be the space of conductances , where denotes the edge set of . Note that acts on by translations. A -invariant random conductance model is a -invariant probability measure on . We say that a -invariant random conductance model is ergodic if it is ergodic under the -action. Each element of determines a nearest neighbor Markov kernel on as follows:
for and , and other transition probabilities are zero. This kernel is denoted by and the corresponding Markov chain starting from is denoted by . We call uniformly elliptic if is contained in for some .
Definition 4.2 (Path bundles).
Let be a -invariant uniformly elliptic random conductance model on . We define the weighted version of by
where is the expectation of the sum of conductances at . We define the path bundle by as a Borel space, and we endow with the probability measure defined by
where denotes the distribution of sample paths of , which is a probability measure on . Further, we define the shift map on by .
The following result is crucial for our ergodic-theoretic approach. Note that this type of results are quite standard in the context of random walks in random environments.
Theorem 4.3.
Let be an ergodic -invariant random conductance model on . Then the system is an ergodic probability-measure-preserving system.
For the proof, we refer to Appendix A.
This theorem can be used to deduce that is regular for -almost every . Further, we can show that the entropy and the speed are positive and constant for -almost every .
Theorem 4.4.
Let be an ergodic -invariant uniformly elliptic random conductance model. Then for -almost every , the random walk is regular for -almost every , and its entropy and speed do not depend on and are positive.
Proof.
First, we show that for -almost every , is regular and its entropy and speed are constant. For , we define functions on as follows:
-
•
,
-
•
.
Then we have
and
Therefore, we can apply Kingman’s ergodic theorem to and , and hence for -almost every , is regular and its entropy and speed are constant. We show that they are positive in the rest of the proof. It is known that the entropy is positive if and only if the speed is positive (see Proposition 3.6 in [BC12] for example). Therefore it is enough to show that the speed is positive. For a subset of the vertices of , we define its edge-boundary by
Then, for and every nonempty finite subset of the vertices of , we have
where is the lower bound for , guaranteed by the uniform ellipticity. Since is nonamenable, this implies that the network determined by is nonamenable. Then, the claim follows from the fact that the random walk on a nonamenable network with exponential growth (note that has exponential growth since is nonamenable) has positive speed (see Section 6.2 in [LP16]). ∎
Then, we can consider the harmonic measures (Theorem 2.11) and the ray bundle in the above setting, as follows.
Definition 4.5 (Ray bundles).
The ray bundle is as a Borel space, and we consider the probability measure on by
where denotes the harmonic measure associated with for -almost every . Note that is equal to the pushforward measure .
Lemma 4.6.
The diagonal action of on is ergodic with respect to .
Proof.
Let be a -invariant subset of . Since is equal to the pushforward measure , it is enough to prove that the inverse image of under is -null or -conull. Note that the -invariance of implies the -invariance of by the definition of . Since is ergodic with respect to by the Theorem 4.3, it implies the claim. ∎
4.2. The Dimension Formula for Invariant Random Conductance Models
In this subsection, we prove the main theorem for random conductance models as above. First, we have the following two results:
Theorem 4.7.
Let be an ergodic -invariant uniformly elliptic random conductance model on . Then, for -almost every and -almost every , we have
where and denote the entropy and the speed of , respectively. In particular, .
Theorem 4.8.
Let be an ergodic -invariant uniformly elliptic random conductance model on . Then, for and -almost every , the set defined by
is -positive.
Combining these theorems with the ergodicity established in the previous section, we have the following result.
Theorem 4.9.
Let be an ergodic -invariant uniformly elliptic random conductance model on . Then, for -almost every , letting be the harmonic measure on determined by , we have
for -almost every , where and denote the entropy and the speed of , respectively. In particular, is positive and constant for -almost every .
Proof.
We have already shown that the upper bound in Theorem 4.7. The lower bound can be deduced from Theorem 4.8 as follows. We want to show that is -conull for every . It is enough to prove that is invariant under the diagonal action of since the diagonal action of is ergodic with respect to (Lemma 4.6) and is -positive (Theorem 4.8). Let and . For , let denote the distribution of sample paths starting from following . Then, for every Borel subset , we have
where we have used the strong Markov property of in the second equality. The third equality follows from the equality . Further, by Lemma 2.4, we have , where is a constant depending only on . Using these estimates, we have
and hence , as required. ∎
5. Invariant Percolations
In this section, we consider invariant percolations. The arguments in this section are almost parallel to the case of random conductance models. However, we need some modifications since does not act on the space of environments in this case. Throughout this section, denotes a nonelementary hyperbolic group and denotes its Cayley graph with respect to some generating set of , and denotes the edge set of .
5.1. Ergodic Theory of Invariant Percolations
Definition 5.1 (-invariant percolations).
A -invariant percolation on is a -invariant probability measure on . Note that acts on by translations. We say that a -invariant percolation is ergodic if it is ergodic under the -action. We identify an element with a spanning subgraph of such that if and only if , and denote by the connected component (often called cluster) of containing . We define by
Note that is not -invariant. In the rest of this section, we always assume that . Note that by the -invariance of , if has an infinite cluster with -positive probability, then . Each gives a Markov kernel defined on as follows:
if and . Since , each has at least one neighbor in , and hence the denominator is not zero. Let denote the Markov chain starting from determined by .
Let us introduce cluster relations and indistinguishability, following [Gab05] and [GL09]. They can be used as substitutes for the -action on the space of environments and its ergodicity, respectively.
Definition 5.2 (Cluster relations and indistinguishability).
Let be an ergodic -invariant percolation on satisfying . We define the cluster relation on by
This is actually an equivalence relation on . Note that for , the -class containing can be identified with the vertices of via . We say that has indistinguishable infinite clusters if the restricted relation is ergodic with respect to . Recall that a countable Borel equivalence relation on a standard probability space is called ergodic if every Borel subset satisfying the equation
is -null or -conull. Note that many invariant percolation models (including supercritical Bernoulli percolations) are known to have indistinguishable infinite clusters [LS99].
Remark 5.3.
Definition 5.4 (Path bundles).
Let be a -invariant percolation on . We define the weighted version of on by
where is the expected degree at on . The path bundle associated with is as a Borel space, and we endow with the probability measure defined by
where denotes the distribution of sample paths of , which is a probability measure on . Further, the shift map on is defined by .
The following theorem is crucial for our study.
Theorem 5.5.
Let be an ergodic -invariant percolation on with indistinguishable infinite clusters. Then the system is ergodic and measure-preserving.
Note that this type of result is well known in the context of random walks in random environments (see [BB07], for example). We refer to Appendix A for the proof.
This theorem implies that the speed and the entropy of the simple random walks on percolation clusters exist and they are constant -almost surely. Note that they may be zero in some invariant percolations like wired uniform spanning forests (see Remark 4.5 in [BLS99]). However, many interesting examples are known to have positive entropy and speed as indicated in the following result due to Benjamini, Lyons, and Schramm.
Theorem 5.6 (Theorem 4.4 in [BLS99]).
Let be a Cayley graph of a nonamenable group and be an ergodic -invariant percolation on with indistinguishable infinite clusters. Assume one of the following conditions:
-
•
is a supercritical Bernoulli percolation.
-
•
-almost every has a unique infinite cluster.
-
•
-almost every has a cluster with at least three ends.
-
•
The expected degree at on is larger than , where is the isoperimetric constant of .
Then for -almost every , the simple random walk on is regular and its entropy and speed do not depend on and are positive.
In such cases, we can consider the corresponding harmonic measures by Theorem 2.11 and define the ray bundle.
Definition 5.7 (Ray bundles).
Let be an ergodic -invariant percolation on with indistinguishable infinite clusters. Assume that the corresponding simple random walk has positive speed, i.e., the simple random walk on has positive speed for -almost every . Note that the simple random walk determines the corresponding harmonic measure for -almost every by Theorem 2.11. The ray bundle associated with is as a Borel space, and we endow with the probability measure defined by
Next, we define an equivalence relation which substitutes for the diagonal action of on the ray bundle and show its ergodicity with respect to .
Lemma 5.8.
Let be an ergodic -invariant percolation on with indistinguishable infinite clusters. Assume that the corresponding simple random walk has positive speed. Then, the following equivalence relation on is ergodic with respect to :
Proof.
Let be an -invariant subset of . Then the inverse image of under is invariant under the shift map . Since is ergodic with respect to (Theorem 5.5) and , it implies that is null or conull. ∎
5.2. The Dimension Formula for Invariant Percolations
In this subsection, we prove the main theorem of this paper.
Theorem 5.9.
Let be an ergodic -invariant percolation with indistinguishable infinite clusters. Assume that the corresponding simple random walk has positive speed. Then, for -almost every , letting be the harmonic measure on determined by , we have
for -almost every , where and denote the entropy and the speed of , respectively. In particular, is positive and constant for -almost every .
Corollary 5.10.
Let be an ergodic -invariant percolation with indistinguishable infinite clusters. Assume one of the following conditions:
-
•
is a supercritical Bernoulli percolation.
-
•
-almost every has a unique infinite cluster.
-
•
-almost every has a cluster with at least three ends.
-
•
The expected degree at on is larger than , where is the isoperimetric constant of .
Then, for -almost every , letting be the harmonic measure on determined by , we have
for -almost every . In particular, is positive and constant for -almost every .
In the rest of this section, we prove Theorem 5.9. First, we have the following results as in the case of random conductance models.
Theorem 5.11.
Let be an ergodic -invariant percolation on with indistinguishable infinite clusters. Assume that the corresponding simple random walk has positive speed. Then, for -almost every and for -almost every , we have
where and are the entropy and the speed of , respectively. In particular, we have for -almost every .
Proof.
This follows from Theorem 3.1 and the assumption that the speed is positive. ∎
Theorem 5.12.
Let be an ergodic -invariant percolation on with indistinguishable infinite clusters. Assume that the simple random walk on has positive speed. Then, for every , the subset of defined by
is -positive, where is the probability measure defined in Definition 5.7.
Proof.
This follows from Theorem 3.2 and the assumption that the speed is positive. ∎
In the proof of Theorem 3.1 in [Tan19], the ergodicity of the -action on is used to prove that is actually full measure. We can modify the argument by using ergodicity of the equivalence relation defined in Lemma 5.8.
Proof of Theorem 5.9.
Let us show that the set in Theorem 5.12 is -conull for every . It is enough to prove that is -invariant since is ergodic with respect to (Lemma 5.8) and is -positive (Theorem 5.12). Let be an element in and . For , let denotes the distribution of sample paths starting from following . Then, for every Borel subset , we have
where we have used the strong Markov property of in the second equality. The third equality follows from the equality . Note that since . Further, by Lemma 2.4, we have where is a constant depending only on . Then, we have
from the above estimates and . Hence, it follows that , as required. ∎
6. Application to hyperbolic tilings
Let be the hyperbolic plane and be its base point. For the pair of positive integers and with , let be the regular tiling of by -gons with interior angles , and be the pair of the cocompact Fuchsian group and its generating set corresponding to . Let be the Cayley graph of . In this section, we always consider the metric on induced from the standard hyperbolic metric on by identifying with for .
In [CLP21], Carrasco, Lessa, and Paquette gave a lower bound for the speed of the simple random walks in Bernoulli percolation clusters on , with respect to .
Theorem 6.1 (Theorem 3.3 in [CLP21]).
Let be a supercritical Bernoulli percolation on with , and be the speed of the simple random walks determined by , with respect to . Then we have
when , uniformly in .
Combining this theorem with our result, we obtain the dimension drop on for all large .
Theorem 6.2.
Let be a supercritical Bernoulli percolation on with . Then, for -almost every , letting be the harmonic measure associated with the simple random walk on starting from 1, we have
for -almost every . Further we have
uniformly in , where denotes the dimension of for -almost every .
7. Questions and Remarks
In this section, we propose some natural questions concerning our results and related works. First, we review dimension drop phenomena. In various settings, it has been shown that the dimension of the harmonic measure associated with a random walk is strictly smaller than the dimension of the boundary (see [LPP95], [Led01], [GMM18], [Kos21], [CLP21], and [KT22]). Such a phenomenon is called dimension drop. In the context of random walks in percolation clusters, we can consider the stronger version of dimension drop phenomena.
Question 7.1.
Let a -invariant percolation on as in Theorem 5.9. When is the inequality
strict for -almost every ? Here denotes the limit set of , i.e., . We can also consider the analogous question in the setting of hyperbolic tilings.
Note that Theorem 6.2 can be seen as a partial answer to this question in the case of Bernoulli percolations on hyperbolic tilings.
Next, we focus on Bernoulli percolations. In [Lal01], Lalley investigated the behavior of the dimension of the limit sets of percolation clusters of when the parameter varies, and obtained the monotonicity and the continuity. We can consider the following analogue of his results:
Question 7.2.
Let be a supercritical Bernoulli percolation on and be the dimension of harmonic measures associated with . Is the function continuous or monotone increasing?
By Theorem 5.9, the continuity of the dimension can be reduced to that of the entropy and the speed. I do not know anything about the monotonicity of them. Note that the monotonicity of the entropy was conjectured in [BLS99] and it still remains open. See also a recent paper by Lyons and White [LW23].
Appendix A Proof of Theorem 5.5
In this appendix, we give the proof of Theorem 5.5.
Similar arguments work for Theorem 4.3.
Before the proof, we first define the bilateral version of the system by
-
•
-
•
-
•
,
where denotes the distribution of bilateral sample paths following starting from 1.
Proof of Theorem 5.5.
It is enough to show that the bilateral version is measure-preserving and ergodic since the natural projection from the bilateral version to is a factor map commuting with the shift maps.
First, we show that the bilateral system is measure-preserving. Let be a Borel subset of .
Then, we have
where the fourth equality follows from the -invariance of and the fifth equality follows from .
This completes the proof that is measure-preserving.
We prove that the bilateral system is ergodic in the rest of the proof, following Section 2 in [BB07]. For each Borel subset , we define a function on by . Let be a -invariant subset of . We first show that
for -almost every . For , there exist and a Borel subset of such that
-
•
= , and
-
•
is an event depending only on ,
where denotes the norm on . Since is -invariant, we have
Note that the second inequality follows from the fact that the events and are independent, conditional on . Since can be taken arbitrarily, the above estimate implies that for -almost every . Therefore, it is enough to show that the subset of defined by
is -invariant since is ergodic with respect to . We want to show that for and satisfying . Since , we have
where denotes the distribution of bilateral sample paths following starting from . Note that we have used the -invariance of and the strong Markov property of in the first inequality. As , this implies , and hence completes the proof. ∎
References
- [AHNR16] Omer Angel, Tom Hutchcroft, Asaf Nachmias, and Gourab Ray, Unimodular hyperbolic triangulations: circle packing and random walk, Invent. Math. 206 (2016), no. 1, 229–268. MR 3556528
- [BB07] Noam Berger and Marek Biskup, Quenched invariance principle for simple random walk on percolation clusters, Probab. Theory Related Fields 137 (2007), 83–120.
- [BC12] Itai Benjamini and Nicolas Curien, Ergodic theory on stationary random graphs, Electron. J. Probab. 17 (2012), no. 93, 1–20.
- [BHM11] Sébastien Blachère, Peter Haïssinsky, and Pierre Mathieu, Harmonic measures versus quasiconformal measures for hyperbolic groups, Ann. Sci. Éc. Norm. Supér. (4) 44 (2011), 683–721.
- [BLS99] Itai Benjamini, Russell Lyons, and Oded Schramm, Percolation perturbations in potential theory and random walks, Random walks and discrete potential theory (Cortona, 1997), Sympos. Math., vol. XXXIX, Cambridge Univ. Press, Cambridge, 1999, pp. 56–84.
- [CLP21] Matías Carrasco, Pablo Lessa, and Elliot Paquette, On the speed of distance-stationary sequences, ALEA Lat. Am. J. Probab. Math. Stat. 18 (2021), 829–854.
- [Gab05] Damien Gaboriau, Invariant percolation and harmonic Dirichlet functions, Geom. Funct. Anal. 15 (2005), 1004–1051.
- [GL09] Damien Gaboriau and Russell Lyons, A measurable-group-theoretic solution to von Neumann’s problem, Invent. Math. 177 (2009), 533–540.
- [GMM18] Sébastien Gouëzel, Frédéric Mathéus, and François Maucourant, Entropy and drift in word hyperbolic groups, Invent. Math. 211 (2018), 1201–1255.
- [Gro87] Mikhael Gromov, Hyperbolic groups, Essays in group theory, Math. Sci. Res. Inst. Publ., vol. 8, Springer, New York, 1987, pp. 75–263.
- [Kai98] Vadim A. Kaimanovich, Hausdorff dimension of the harmonic measure on trees, Ergodic Theory Dynam. Systems 18 (1998), 631–660.
- [Kai00] by same author, The Poisson formula for groups with hyperbolic properties, Ann. of Math. (2) 152 (2000), 659–692.
- [Kos21] Petr Kosenko, Fundamental inequality for hyperbolic Coxeter and Fuchsian groups equipped with geometric distances, Int. Math. Res. Not. IMRN (2021), 4709–4728.
- [KT22] Petr Kosenko and Giulio Tiozzo, The fundamental inequality for cocompact Fuchsian groups, Forum Math. Sigma 10 (2022), Paper No. e102, 21.
- [Lal01] Steven P. Lalley, Percolation clusters in hyperbolic tessellations, Geom. Funct. Anal. 11 (2001), 971–1030.
- [Led01] François Ledrappier, Some asymptotic properties of random walks on free groups, Topics in probability and Lie groups: boundary theory, CRM Proc. Lecture Notes, vol. 28, Amer. Math. Soc., Providence, RI, 2001, pp. 117–152.
- [LP07] Vincent Le Prince, Dimensional properties of the harmonic measure for a random walk on a hyperbolic group, Trans. Amer. Math. Soc. 359 (2007), 2881–2898.
- [LP16] Russell Lyons and Yuval Peres, Probability on trees and networks, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 42, Cambridge University Press, New York, 2016.
- [LPP95] Russell Lyons, Robin Pemantle, and Yuval Peres, Ergodic theory on Galton-Watson trees: speed of random walk and dimension of harmonic measure, Ergodic Theory Dynam. Systems 15 (1995), 593–619.
- [LS99] Russell Lyons and Oded Schramm, Indistinguishability of percolation clusters, Ann. Probab. 27 (1999), 1809–1836.
- [LW23] Russell Lyons and Graham White, Monotonicity for continuous-time random walks, Ann. Probab. 51 (2023), 1112–1138.
- [Tan19] Ryokichi Tanaka, Dimension of harmonic measures in hyperbolic spaces, Ergodic Theory Dynam. Systems 39 (2019), 474–499.