Solidification of porous interfaces and disconnection
Maximilian Nitzschner, Alain-Sol Sznitman

TL;DR
This paper establishes uniform estimates on Brownian motion absorption by porous interfaces around compact sets and applies these to improve large deviation bounds for random walk and interlacements disconnection probabilities in high dimensions.
Contribution
It introduces new uniform estimates for Brownian motion absorption and strengthens large deviation results for disconnection events without convexity assumptions.
Findings
Uniform estimates on Brownian motion absorption by porous interfaces.
Large deviation upper bounds for disconnection probabilities in Z^d.
No convexity assumption required on the compact set.
Abstract
In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian motion starting in the compact set. As an application of our results, we substantially strengthen the results of arXiv:1412.3960, and obtain when , large deviation upper bounds on the probability that simple random walk in , or random interlacements in , when their vacant set is in a strongly percolative regime, disconnect the discrete blow-up of a regular compact set from the boundary of the discrete blow-up of a box containing the compact set in its interior. Importantly, we make no convexity assumption on the compact set. It is plausible, although open at the moment, that the upper bounds that we derive in this work match in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
SOLIDIFICATION OF POROUS INTERFACES
AND DISCONNECTION
Abstract
In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian motion starting in the compact set. As an application of our results, we substantially strengthen the results of [22], and obtain when , large deviation upper bounds on the probability that simple random walk in , or random interlacements in , when their vacant set is in a strongly percolative regime, disconnect the discrete blow-up of a regular compact set from the boundary of the discrete blow-up of a box containing the compact set in its interior. Importantly, we make no convexity assumption on the compact set. It is plausible, although open at the moment, that the upper bounds that we derive in this work match in principal order the lower bounds of [15] in the case of random interlacements, and of [14] for the simple random walk.
Maximilian Nitzschner and Alain-Sol Sznitman
——————————–
Departement Mathematik, ETH Zürich, CH-8092 Zürich, Switzerland.
0 Introduction
The notion of capacity has many facets. Given a compact subset of , , its Brownian capacity can for instance be viewed as a measure of its size for Brownian motion coming from far away, see [18], p. 58. But it also equals the infimum of the Dirichlet energies of smooth compactly supported functions equal to on a neighborhood of , see [20], p. 87, and also alternatively the inverse of the infimum of the energies of probability measures supported by , see [20], p. 76. It is a classical fact of potential theory that any compact set that separates from infinity has a Brownian capacity , which is bounded from below by . However, when such an “interface” is replaced by a “porous deformation” , uniform comparisons between and become more delicate, in part due to the possible degenerations of the interfaces and porous interfaces under consideration. When is convex, the problem can sometimes be circumvented with the help of the projection attached to , but the issue becomes acute when no convexity assumption is made on . The challenge is then to bring into play a notion of porous interfaces, which has meaningful consequences, and is relevant for applications.
In this article we make no convexity assumption on . We introduce a notion of porous interfaces surrounding , and obtain uniform estimates for the absorption by of Brownian motion starting in . These solidification estimates readily lead to uniform comparisons between and . An important ingredient in proving such solidification estimates is the construction of certain resonance sets, which are hard to avoid for Brownian motion starting in , and where on many scales the local densities of the interior and the exterior of the segmentation underlying remain balanced.
As an application of these estimates, we are able to substantially strengthen the results of [22] and obtain large deviation upper bounds on the probability that simple random walk in , or random interlacements in , when their vacant set is in a strongly percolative regime, disconnect the discrete blow-up of a regular compact set from the boundary of the discrete blow-up of a box containing in its interior. Whereas the results of [22] handled the case when is itself a box, and the methods of [22] might conceivably have been extended to handle the case of a regular compact convex set , the case treated here, when is a regular compact set, requires a genuinely new approach to the coarse graining procedure, which is employed. Quite plausibly, the upper bounds that we derive in this work are sharp and match in principal order the large deviation lower bounds obtained in [14] and [15].
We will now describe our results in a more precise form. We consider , mainly when (although throughout Section 1). We consider a non-empty compact subset of , and a collection of “interfaces” , where is a bounded Borel subset of and its complement. To control the “distance” of to , we define for non-negative integer
[TABLE]
(this last condition is for instance satisfied when the sup-distance of to exceeds ).
At a heuristic level the “interface” can be viewed as a kind of segmentation of the “porous interfaces”, which we now introduce. For a given , and , respectively measuring the distance from at which the porous interface is felt, and the strength with which it is felt, we consider in the hard obstacle case
[TABLE]
where stands for the Wiener measure starting from , governing the canonical Brownian motion on , for the entrance time of in , and for the first time moves at sup-distance from its starting point.
\psfrag{s}{}\psfrag{e}{}\psfrag{A}{}\psfrag{S}{}\psfrag{U0}{}\psfrag{U1}{}\psfrag{2ell}{}\includegraphics[width=369.88582pt]{fig1.eps}
Fig. 1: An illustration of a in and in
In the soft obstacle case, we instead consider
[TABLE]
where stands for the expectation relative to the measure .
Asymptotic solidification estimates play a central role in this work. They appear in Theorem 3.1 and for given and they provide controls in the limit where tends to zero, on the trapping probability of Brownian motion starting in by the porous interface, uniformly over or , , and over the starting point in . Namely, for given and , we show that
[TABLE]
(where stands for the supremum over , , , and ), and
[TABLE]
(where stands for the supremum over , , , and ), and actually, the quantities under the “” sign in both (0.4) and (0.5) are maximal when (see also Remark 3.6 2) for a reformulation of (0.4), (0.5), using scaling when ).
As an application of (0.4), we show in Corollary 3.4 an asymptotic lower bound on capacity that plays a pivotal role in our treatment of the disconnection problems that we consider in Section 4. Namely when , with a similar meaning as below (0.4), one has
[TABLE]
Importantly, no convexity assumption is made on . When is convex, asymptotic lower bounds on are often easier to achieve, as explained in Remark 3.6 3).
As a (straightforward) illustration of (0.5), we consider the time spent by Brownian motion in the -neighborhood of for the sup-distance, and show in Corollary 3.5 that for any and ,
[TABLE]
The difficulty in proving (0.4) (or (0.5)) stems from the fact that varies over the whole class and the interface as well as the porous interface may undergo degenerations and become brittle in certain parts of space (where, for instance, they can behave as a soft potential due to an effect of a “constant capacity regime”, see Remark 3.6 1)).
An important ingredient in the proof of Theorem 3.1 (cf. (0.4), (0.5)) is the construction of certain resonance sets, where on well-separated spatial scales the local densities of both and its complement are non-degenerate. Specifically, given and integers , (see (1.27)) and the resonance set is (see (2.5))
[TABLE]
where is a dimensional constant, denotes the local density of in the closed box of center and side-length , and ranges over , which in essence, see (2.3) for the precise definition, consists of the first integers in that are bigger or equal to .
The resonance set need not separate from infinity (see Remark 2.3 1)), but crucially, as shown in Theorem 2.1, it is hard for Brownian motion starting in to avoid the resonance set when is large. We even obtain stretched-exponential bounds on the avoidance probability and show in Theorem 2.1 that for any ,
[TABLE]
Actually, as shown in Theorem 2.1, the quantity under the logarithm is maximal when .
Equipped with the crucial estimate (0.9), we can use the resonance set in (0.8) as a substitute for a Wiener criterion, and infer that the porous interfaces , or the soft obstacles , whose presence is felt in the -vicinity of , have massive trapping power as quantified by (0.4) and (0.5), see Theorem 3.1 and its proof.
In Section 4, we apply Corollary 3.4 (see (0.6)), to a disconnection problem for simple random walk on , or for random interlacements on , when their vacant set is in the strongly percolative regime , with the critical level from [22], cf. (2.3) in this reference. We consider a non-empty compact subset of contained in the interior of a box of side-length centered at the origin, as well as the discrete blow-up of and the interior boundary of the discrete blow-up of the above mentioned box:
[TABLE]
(where denotes the integer part).
In the case of random interlacements, we are interested in the disconnection event corresponding to the absence of paths in between and , denoted by
[TABLE]
( coincides with the full sample space if happens to be empty).
When the compact set is regular in the sense that
[TABLE]
we show that for , that is in the strongly percolative regime for , one has
[TABLE]
Our results are actually more general, see Theorem 4.1 and also Remark 4.5 3).
In the case of the simple random walk, we similarly consider the vacant set that is the complement of the set of sites visited by the canonical walk on . We are then interested in the disconnection event corresponding to the absence of paths in between and
[TABLE]
(and coincides with the full canonical space if happens to be empty).
As a rather straightforward consequence of (0.13) (this formally corresponds to letting ), we show in Corollary 4.4 that when fulfills the regularity condition (0.12), then for any in
[TABLE]
(with the canonical law of simple random walk starting at ).
Again, our results are more general, see Corollary 4.4 and Remark 4.5 3). Actually, it is plausible that the upper bounds (0.13), (0.15) catch the correct principal exponential decay of the probabilities under consideration, and match the lower bounds respectively derived in [15] and [14]. This feature rests on the identification (open at the moment) of with the box-to-box critical level for the percolation of the vacant set of random interlacements, so that one would then have the equalities , with the critical level for the percolation of the vacant set of random interlacements. Incidentally, the recent work [11] might lead to some progress towards a proof of . The coincidence of the three critical levels would then show that under (0.12),
[TABLE]
The lower bounds in [15] for the case of random interlacements, and [14] for the case of simple random walk are based on the change of probability method. They respectively involve probability measures (in the case of random interlacements) and (in the case of simple random walk) implementing certain “strategies” to produce disconnection. If the critical values actually coincide, the results of the present work show that these strategies are (nearly) optimal and thus hold special significance. We briefly sketch what these strategies are.
In the case of random interlacements, the measures from [15] correspond to so-called tilted interlacements that are slowly space-modulated interlacements at a level (slowly varying over space) equal to , , where on is the solution of the equilibrium problem
[TABLE]
with a slight thickening of . Informally, the tilted interlacements create a “fence” around on which they locally behave as interlacements at level (one actually chooses in place of in the formula for , with a small positive number). They produce locally on this fence a strongly non-percolative regime for the vacant set, and typically disconnect from , when is large. Informally, the tilted interlacements correspond to a Poisson cloud of bilateral trajectories, which are governed by the generator , instead of the discrete Laplacian (corresponding to the case when is a constant function).
In the case of the simple random walk, the measures from [14] correspond to tilted walks that in essence behave as a walk with generator up to a deterministic time and afterwards move as a simple random walk, where , with as in (0.16) and is chosen such that the expected time spent by the tilted walk at a point amounts to (with the choice of in (0.16)). Again, this creates a “fence” around , where the vacant set left by the tilted walk at time is locally in a strongly non-percolative regime, and typically disconnects from , for large (one actually chooses a compactly supported approximation of in (0.16) for the definition of the tilted walk).
Let us emphasize that no convexity assumption is made on in the derivation of the upper bounds (0.13), (0.15). This represents an important progress on [22], where was assumed to be a box. We use a different approach to the coarse graining of the disconnection event . The notion of porous interfaces and Corollary 3.4 (cf. (0.6)) play a pivotal role in the derivation of (0.13). The scale in (0.6) roughly corresponds to , cf. (4.19), where is a scale slightly smaller than , on which we perform a “segmentation” of an interface of “blocking boxes” of a much smaller scale , slightly bigger than , cf. (4.19), which is present when the disconnection event occurs. In a sense we follow a refined version of the strategy for the tracking of interfaces underpinning Section 2 of [7]. After removal of a “bad event” of negligible probability from the disconnection event , we obtain the effective disconnection event , cf. (4.41). We partition into a not too large collection of events (where runs over a set of elements). This partition embodies the coarse graining, cf. (4.45). In essence, each event corresponds to the selection of discrete “blocking boxes” of side-length having “substantial presence” in each of the selected boxes of side-length (see Figure 2). If denotes the union of all selected boxes of side-length , we have an exponential estimate on the probability of each in terms of , cf. (4.14). With the help of Proposition A.1 in the Appendix, we can in essence replace by , where (the porous interface) corresponds to the solid -filling of . At this point crucially Corollary 3.4 enables us to obtain an asymptotic uniform lower bound of in terms of . In our application of Corollary 3.4, it should be underlined that both the interface and the porous interface are “constructs of the coarse graining procedure”, cf. (4.48), (4.49) (in particular is by no means a priori given). We refer to Section 4 below (4.26) for a more detailed outline of the proof of Theorem 4.1 (cf. (0.13)).
\psfrag{s}{}\psfrag{e}{}\psfrag{A}{}\psfrag{S}{}\psfrag{U0}{}\psfrag{U1}{}\psfrag{2ell}{}\psfrag{AN}{}\psfrag{SN}{}\psfrag{L0}{\small{}}\psfrag{LaN}{\small{ slightly smaller than }}\psfrag{Lsk}{\small{ slightly bigger than }}\includegraphics[width=227.62204pt]{fig2.eps}
[TABLE]
Plausibly, the methods of this article might be pertinent in the context of level-set percolation of the Gaussian free field and lead to an improvement of the results of [21], see Remark 4.5 1). One may also wonder whether in the spirit of the Wulff shape theory for the existence of a large finite cluster at the origin in supercritical Bernoulli percolation, cf. [3] and the references therein, some insight might be gained concerning the behavior of a large finite connected component at the origin for the vacant set of random interlacements in the strongly percolative regime .
Let us now describe the organization of this article. Section 1 collects several results concerning the local density functions. In particular, Proposition 1.4 provides in essence a lower bound for the probability that Brownian motion enters the resonance set when starting at a good point. In Section 2, the main Theorem 2.1 shows that when starting in , Brownian motion can hardly avoid the resonance set, cf. (0.9). Lemma 2.2 contains an important induction step for the proof of Theorem 2.1. In Section 3, we introduce the notion of porous interfaces and show the central solidification estimates in Theorem 3.1, see also (0.4), (0.5). We then provide a first application with the capacity lower bound (0.6) in Corollary 3.4 and a second (and quicker) application to the estimate (0.7) in Corollary 3.5. In section 4, we derive with the help of Corollary 3.4 the large deviation upper bounds (0.13), (0.15) on the probability of the disconnection events (0.11), (0.14) in Theorem 4.1 and Corollary 4.4. Additional estimates appear in Remark 4.5 3). In the Appendix, we provide in Proposition A.1 an asymptotic comparison between the simple random walk capacity of arbitrary finite unions of well-separated large boxes and the Brownian capacity of the solid filling of these boxes.
Finally, let us explain our convention concerning constants. We denote by positive constants changing from place to place that simply depend on . Numbered constants such as refer to the value corresponding to their first appearance in the text. Dependence of constants on additional parameters appears in the notation.
1 Local density functions
In this section we develop several controls concerning certain local density functions that will help us track the presence of interfaces. The main result is contained in Proposition 1.4. In essence, it provides a lower bound on the probability that Brownian motion starting at a point where the local density on a certain scale is well-balanced, visits before moving at a distance comparable to that scale a point where on several well-separated smaller scales the local densities are well-balanced. This result will be of direct use in the proof of Theorem 2.1 in the next section. We begin with some notation.
Throughout this section we assume that . We denote by and the respective sup-norm and -norm of . For , we let stand for the closed ball in sup-norm with center and radius . When is a subset of , we write for its closure, for the interior, and for its boundary. We let ; denote the sup-norm distance of to . When is a Borel subset of , we sometimes write for its Lebesgue measure.
We denote by the canonical -valued process on , the space of continuous -valued functions on , which we endow with the canonical -algebra and the canonical right-continuous filtration denoted by . We let stand for the canonical shift (so that , for and ). We denote by the Wiener measure starting from , and by the corresponding expectation. So, under the process is the canonical Brownian motion on starting from . When is a closed subset of , we write for the entrance time of in , ; for the hitting time of , and when is an open subset of , we write ; ( for the exit time of . They all are -stopping times.
We consider
[TABLE]
The boundary
[TABLE]
is a compact subset of . In Section 3 the porous interface corresponding to in the hard obstacle case, or to in the soft potential case, will be “palpably” present in the vicinity of every point of . At a heuristic level, will be some kind of “segmentation” for the porous interface.
In this section we are mainly concerned with the development of various controls on certain local density functions (in dyadic scales), which we now introduce. For and , we set
[TABLE]
Eventually, our main interest will lie in the case , i.e. in the local scale picture, but for the time being in this section, we do not impose any restriction on the sign of . As a shorthand for the average of a locally integrable function on a sup-norm ball , with , , we write
[TABLE]
and we introduce the normalized Lebesgue measure restricted to
[TABLE]
We first collect some facts concerning the Lipschitz character of the local densities and , and we relate to the average of on when .
Lemma 1.1**.**
For , , one has
[TABLE]
Moreover, for in and one has
[TABLE]
Proof.
We begin with the proof of (1.6), and note that the claim follows from the fact that for collinear to a vector of the canonical basis of ,
[TABLE]
The claim (1.6) readily follows. The claim (1.7) follows as well since , cf. (1.3). We now turn to the proof of (1.8). We consider in and note that for ,
[TABLE]
where stands for the continuous compactly supported function
[TABLE]
so that
[TABLE]
Coming back to (1.10), we find that
[TABLE]
In a similar fashion, we have
[TABLE]
Collecting (1.13) and (1.14), we find (1.8). This concludes the proof of Lemma 1.1. ∎
The next lemma will show that when and has an average in a box , then, either takes with sizeable measure in the box values bigger and values smaller than by a certain amount, or that takes with sizeable measure in the box values close to . This lemma will later be useful when showing in Proposition 1.3 that Brownian motion starting at has a sizeable probability to reach points where is close to before exiting .
Lemma 1.2**.**
For and in , set
[TABLE]
Then, for at least one of i) or ii) below holds:
[TABLE]
(we refer to (1.5) for the definition of .
Proof.
We introduce on some auxiliary probability space governed by the probability , with corresponding expectation denoted by , a -valued random variable with same law as under , so that . We let for , and note that for , and . Given , either
[TABLE]
In case b), we also find that
[TABLE]
so that
[TABLE]
At the same time, since , , so that
[TABLE]
Dividing both members by , we find, since is non-increasing, that . Since we are in case b), we also have . It now follows that in case (1.17) b) we additionally have
[TABLE]
We now consider , so that , . We further note that . We can then introduce for . If we now let take the role of in the alternative (1.17), we see that either
[TABLE]
Additionally, we know that in case d)
[TABLE]
Thus, when either b) in (1.17) or d) in (1.19) holds we obtain (1.16) ii). So, when (1.16) ii) does not hold, necessarily both a) in (1.17) and c) in (1.19) hold. This yields (1.16) i) and concludes the proof of Lemma 1.2. ∎
We will now see that when and has an average over , which is not too close to [math] or , Brownian motion starting at has a non-degenerate probability of entering a region where takes values close to before exiting . For , we introduce the first time when moves at -distance from its starting point (an -stopping time):
[TABLE]
We can now state
Proposition 1.3**.**
For , in , we set . Then, we have
[TABLE]
and for ,
[TABLE]
(where denotes the entrance time of in the closed set ).
Proof.
We first observe that (1.21) is a restatement of (1.8) and we only need to prove (1.22). We use the alternative (1.16) from Lemma 1.2. If (1.16) i) holds, we use translation invariance and scaling to choose solely depending on , such that , so that
[TABLE]
Letting stand for the interior of (i.e. ), we find by translation invariance, scaling, and standard estimates for Brownian motion killed outside that
[TABLE]
It then follows from the strong Markov property that Brownian motion starting at enters and then before exiting with probability at least ). By the continuity of , any such trajectory of Brownian motion enters before exiting . So, when (1.16) i) holds, we find that
[TABLE]
On the other hand, when (1.16) ii) holds, then
[TABLE]
and it follows from standard estimates on killed Brownian motion (as above) that
[TABLE]
Collecting (1.25) and (1.26) we find (1.22). This proves Proposition 1.3.∎
We will now consider decreasing scales , which are well-separated, and see that when starting at in such that , there is a non-degenerate probability for Brownian motion to reach before moving at sup-distance the set of points where all local densities , , lie within the fixed interval , with the constant from (1.35) below. More precisely, we consider , as in (1.8), and we define
[TABLE]
We also consider a sequence of decreasing spatial scales , which are well-separated in the sense that
[TABLE]
Further, we introduce the increasing sequence of compact sub-intervals of :
[TABLE]
as well as the non-decreasing sequence of stopping times
[TABLE]
The next proposition will enter the proof of the main Theorem 2.1 in Section 2. We recall (1.3) and (1.20) for notation.
Proposition 1.4**.**
Assume that , and that , satisfy (1.28). Denote by the event
[TABLE]
Then, for in such that , one has
[TABLE]
Moreover, on the event , one has
[TABLE]
Proof.
We first prove (1.32). We will use induction and Proposition 1.3. We choose (in the notation of Proposition 1.3)
[TABLE]
We want to show by induction on (with as in (1.22)) that
[TABLE]
When , since , we find that and (1.37) is true. Assume now that for some , (1.37) is satisfied. We now define and note that on due to (1.30), one has . Moreover, by (1.21) and (1.28), we have
[TABLE]
We can now apply the strong Markov property at time and find that
[TABLE]
This completes the proof by induction of (1.37) and hence of (1.32) with . As for (1.33), we note that on , for any , one has
[TABLE]
since , so that . This proves (1.33).
We then turn to the proof of (1.34). We note that by (1.33), on the event , one has for any , , and , so that , and (1.34) follows. This concludes the proof of Proposition 1.4. ∎
2 Resonances
In this section we introduce certain resonance sets where at least among a larger collection of local densities of , corresponding to well-separated spatial scales, simultaneously take non-degenerate values in , cf. (1.35). Our main object is Theorem 2.1 below. It shows that for Brownian motion starting at a location where all but finitely many of the local densities are at most , it is hard to avoid such a resonance set. An important induction step for the proof of Theorem 2.1 is contained in Lemma 2.2. We will then use Theorem 2.1 as a main tool in the next section when considering porous interfaces which are markedly felt in the vicinity of . The approach we use remains pertinent in the two-dimensional case, but the formulation of a relevant version of Theorem 2.1 when involves some modification of the set-up (with some killing of Brownian motion). For conciseness and because the application in Section 4 only pertains to the case , we assume from now on that
[TABLE]
As in the previous section, we consider a non-empty, bounded, Borel subset of and the associated local density functions , cf. (1.3). We now want to introduce the resonance set. To this end, we consider (so that will bound from above the scales under consideration, and in some sense bound from below the distance of the starting point of Brownian motion to ), will control the strength of the resonance, (with as in (1.27)), will govern the separation of scales, and , will control the number of scales inspected. We then define (with )
[TABLE]
The resonance set is then defined (with as in (1.35)) as:
[TABLE]
and we sometimes write , if we want to recall the parameters entering its definition. Note that the functions , , are continuous, cf. Lemma 1.1, and finite, so that the resonance set Res is a (possibly empty) compact subset of .
To describe the collection of subsets under consideration in the bounds we wish to derive in Theorem 2.1, we consider some non-empty compact subset in and introduce for as above,
[TABLE]
as well as
[TABLE]
We are now ready to state the main result of this section. It provides stretched exponential bounds in on the probability that Brownian motion starting in avoids the resonance set if , and is large. Incidentally, let us point out that the resonance set need not “block” in a topological sense: may well lie in the unbounded component of the complement of the resonance set, see Remark 2.3.
Theorem 2.1**.**
For , non-empty compact subset of , define (with Res as in (2.5))
[TABLE]
Then, the case is maximal in the sense that
[TABLE]
and as , one has the stretched exponential bound:
[TABLE]
Proof.
We first prove (2.9). To this end, we simply note that and implies that and . The claim (2.9) simply follows by translation invariance of Brownian motion.
We now turn to the proof of (2.10). We consider , , , , as well as some . We then introduce the notion of an -family, which is constituted of stopping times , , of a random finite subset of , and of random integer valued functions , such that
[TABLE]
We recall that for , in particular for all in (2.4). As a result, -a.s., for all , the continuous non-negative functions start at a value smaller or equal to and reach at some point the value (they eventually become equal to for large ). There is however in general no prescribed order in which these “crossings” happen, see Remark 2.3. An example of an -family to keep in mind thus corresponds to the choice
[TABLE]
The formulas for when are merely here for completeness and pertain to -negligible events.
Given an -family as in (2.11), we also define the stopping times
[TABLE]
as well as the -measurable subsets of “intermediate labels” and of “labels”
[TABLE]
Note that , so that
[TABLE]
and that in the notation of (2.3), (2.4)
[TABLE]
Further we introduce for the -resonance set
[TABLE]
(so when as in (2.4), and , we recover the resonance set Res from (2.5)).
We now introduce an important quantity on which we will derive upper bounds by induction on in the crucial Lemma 2.2 below. Namely, for and , we set
[TABLE]
where the supremum is taken over all -families (a non-empty collection by (2.12)), and we set by convention
[TABLE]
We will also drop the superscript from the notation when this causes no confusion.
At this point, the Reader may first read the statement of the next lemma, skip its proof, and directly proceed above (2.34) to see how the proof of Theorem 2.1 is completed. We now have (where we fix , , , ):
Lemma 2.2**.**
[TABLE]
and for , , setting ,
[TABLE]
Proof.
We first prove (2.20). We consider and some -family, cf. (2.11). Then, -a.s., , so that and have relative volume in ). It thus follows that -a.s., lies in , so that . Hence, the probability in the right-hand side of (2.18) equals [math], when and (2.20) follows.
We now turn to the proof of (2.21). We introduce the notation
[TABLE]
We first assume that , (the case will be straightforward to handle) and note that, as we explain below,
[TABLE]
(indeed for , , for , , and for , .
We thus consider as well as , and want to prove (2.21). We consider an -family and write
[TABLE]
We first bound . As a shorthand we write , and find that
[TABLE]
We can use the strong Markov property at time and find that the last expression is smaller or equal to
[TABLE]
where \widetilde{X}_{\mbox{\large.}} denotes the canonical Brownian motion under the Wiener measure starting from , and the respectively -measurable map (with an at most countable set of possible values), and the -measurable map are not integrated under the measure .
If we now choose in (1.32) (and , by (2.11) iii)), then Proposition 1.4 and the fact that -a.s., (by (2.11) iv)), imply that -a.s.,
[TABLE]
Hence, the expression in (2.25) is at most
[TABLE]
By induction, we then find that
[TABLE]
We now bound (cf. (2.24)). To this end, we first note that
[TABLE]
Denote by the event inside the probability in the last member of (2.29). As we now explain, -a.s. on , there are at most integer values of such that . Indeed, otherwise we can find values of in such that with -positive measure on , . Including to this list yields values in such that with -positive measure on , and , and hence for these values. This would force that with -positive measure on , , which is impossible by the very definition of .
Assume for the time being that , and denote by an arbitrary subset of with elements. The number of possible choices of such a subset is at most . It now follows from the remark in the paragraph above and from (2.29) that
[TABLE]
(and denotes the maximum over all possible subsets of with elements).
We then set
[TABLE]
Now , yield (up to the deterministic increasing relabeling of into a -family, cf. (2.11). In addition, on the event under the probability in (2.30), one has for all , , so that -a.s. on this event, and for all .
It follows that -a.s. on the event under the probability in (2.30), (where is defined as in (2.14) with now playing the role of ). This shows that
[TABLE]
(and as mentioned below (2.19) we dropped the superscript from the notation).
Since , for , by convention, see (2.19), one can remove the assumption and find that (recall )
[TABLE]
Adding the bounds (2.28) and (2.33), we find, coming back to (2.24), that
[TABLE]
Taking the supremum over all possible -families yields (2.21) when . However, when , the right-hand side of (2.21) is at least due to the first term in the right-hand side, and (2.21) holds as well. This completes the proof of (2.21) and hence of Lemma 2.2. ∎
We now resume the proof of (2.10) of Theorem 2.1. We introduce the quantity (for given )
[TABLE]
From the definition of , see (2.18), (2.17), and from the -family (2.12), as well as (2.16), we see that in the notation of (2.8), for , one has
[TABLE]
On the other hand, by Lemma 2.2 and (2.34), we see that
[TABLE]
We will now prove by induction on that for ,
[TABLE]
Choosing will complete the proof of (2.10) in view of (2.35).
By the first line of (2.36), the claim (2.37) is immediate when . Then, we assume that (2.37) holds for some . We have
[TABLE]
This proves (2.37) and as explained above concludes the proof of Theorem 2.1. ∎
Remark 2.3**.**
- We describe a simple example showing that the compact set may lie in the unbounded component of the complement of the resonance set defined in (2.5) (in particular, the resonance set need not “block” in a topological sense).
We consider , , and set , for , where so that (2.2) holds. We choose , denote by the first vector of the canonical basis of , and define
[TABLE]
with the rightmost point of on and . That is, is obtained by piling on in the positive -direction a small thin rectangular parallelepiped of length in the -direction and side-length in the other directions. As a shorthand notation we set , for .
Note that is bounded and , so in the notation of (2.7). As we now explain, one also has
[TABLE]
and consequently, for any ,
[TABLE]
To prove (2.39), we set for , , (recall that ). Then, the function is continuous and non-decreasing. For , we have , so that , and for , we have , so that , which is smaller than (because , since and ). It follows that
[TABLE]
On the other hand, for any , and the intervals , , are pairwise disjoint. The claims (2.39) and (2.40) follow.
- Here is another simple example showing that the order in which the level sets are crossed along a Brownian path is in general random. We keep the same notation as in 1) above but now define (see Figure 3)
[TABLE]
\psfrag{s}{}\psfrag{e}{}\psfrag{A}{}\psfrag{S}{}\psfrag{U0}{}\psfrag{U1}{}\psfrag{2ell}{}\psfrag{AN}{}\psfrag{SN}{}\psfrag{L0}{\small{}}\psfrag{LaN}{\small{ slightly smaller than }}\psfrag{Lsk}{\small{ slightly bigger than }}\psfrag{0}{}\psfrag{l0}{}\psfrag{l1}{}\psfrag{ll1}{\tiny{}}\psfrag{l2}{}\psfrag{U0}{}\includegraphics[width=369.88582pt]{fig3.eps}
Fig. 3: An illustration of
In this case similar calculations as in 1) show that the trajectory , , first reaches the level set , then the level set , and then the level set . On the other hand, first crosses the level set , then the level set , and then the level set . This order remains the same for trajectories in small tubular neighborhoods around and . These tubular neighborhoods have positive measure for (the Wiener measure) and the order in which the level sets , are crossed along a Brownian path is thus random. Similar considerations also apply when one instead considers the order in which the level sets are crossed (recall that , cf. (1.3)).
3 Solidification of porous interfaces
We now apply the results of the last section to the study of porous interfaces. The porous interfaces under consideration will be felt within a small distance denoted by from each point of , where , cf. (2.6), with a strength measured by (we recall that controls in a suitable sense the distance of to , cf. (2.6)). The porous interfaces will correspond to hard obstacles or to soft obstacles, and the main Theorem 3.1 of this section provides uniform controls on the trapping probability of Brownian motion starting in by the porous interface when the ratio goes to zero. We then derive an asymptotic lower bound on the capacity of the porous interface in Corollary 3.4 that will play a crucial role in the next section. We also provide an application in the soft obstacle case in Corollary 3.5. In a heuristic fashion the “interfaces” can be thought of as some sort of “segmentation” of the porous interfaces. One should emphasize that in the classes over which they vary, the interfaces and porous interfaces may undergo degenerations. In certain regions of space they may become brittle and have little trapping power, see for instance Remark 3.6 1). Throughout this section we assume .
We first need some notation. We consider as in (1.1), a non-empty bounded Borel subset of and (with as in (1.2). In the hard obstacle case, given and , the porous interfaces will vary in the class
[TABLE]
with the entrance time of Brownian motion in and the first time it moves at sup-distance from its starting point, cf. (1.20). In the soft obstacle case, the porous interfaces will instead vary in the class
[TABLE]
The next theorem is the main result of this section. It provides in the limit going to zero uniform controls on the killing of Brownian motion starting in , when (with ), in the presence of a porous interface corresponding to in the hard obstacle case, or to in the soft obstacle case.
Theorem 3.1**.**
(Solidification of porous interfaces)
Consider a non-empty compact subset of and . Then, in the hard obstacle case, one has
[TABLE]
and the expression under is maximal for the choice .
Likewise, in the soft obstacle case, one has
[TABLE]
and the expression under is maximal for the choice .
(When , scaling can also be applied to reformulate (3.3) and (3.4), see Remark 3.6 2).)
Proof.
Note that in the hard obstacle case, cf. (3.1), when , , , then (, see (2.7) for notation), and , so the maximality statement for the case stated below (3.3) follows. In the soft obstacles case, cf. (3.2), when , as above, and , then and
[TABLE]
whence the maximality of the case stated below (3.4).
We now prove (3.3) in the case (the general case follows by the maximality property explained above). The following lemma will be useful (we recall (1.3), (1.35) and above (1.1) for notation). Incidentally, the Reader may possibly first skip its proof and proceed above (3.8) to see how the proof of (3.3) follows.
Lemma 3.2**.**
For , with , , such that and , one has
[TABLE]
Proof.
Note that and , so that using classical properties of the Dirichlet heat kernel, see for instance [20], p. 13, 18, as well as scaling and translation invariance, we find that
[TABLE]
The event under the probability above is contained in (indeed the continuous trajectory X_{\mbox{\large.}} encounters und during the time interval , and hence meets during the same time interval). So we have
[TABLE]
Then, by the strong Markov property and (3.1), we see that since ,
[TABLE]
This completes the proof of Lemma 3.2. ∎
We can now resume the proof of (3.3) (when ). We pick , (see (1.27)), and for , and , we write Res for the resonance set Res, see (2.5). We recall the notation from (2.3), so satisfies
[TABLE]
We then consider and . As we now explain:
[TABLE]
Indeed, one has by (3.8). One applies the strong Markov property at the successive times of exit of the balls , when , and notes that when in , then , see (1.27)) so that . One can then repeatedly apply (3.5) and obtain that
[TABLE]
and (3.9) follows since .
Thus, for and , we find that for and
[TABLE]
If we now take the supremum over , and , we find after letting tend to zero that
[TABLE]
Letting tend to infinity, the first term in the right member of (3.12) goes to zero by (2.10) of Theorem 2.1. We can then let tend to infinity and obtain (3.3) when (and hence in the general case).
Let us briefly explain how one obtains (3.4). With analogous arguments as for Lemma 3.2, one shows instead with the help of (3.2):
Lemma 3.3**.**
For , with , such that and , one has
[TABLE]
From this lemma and the strong Markov property, one deduces in place of (3.9) that when , and , then for any , , , one has
[TABLE]
One then concludes as below (3.11). This completes the proof of Theorem 3.1. ∎
We can now state a corollary of Theorem 3.1 that will play an important role in the next section in our treatment of certain disconnection problems for random interlacements and the simple random walk on . We denote by the Brownian capacity of a compact subset or a bounded open subset of , cf. [18], p. 57, 58.
Corollary 3.4**.**
(Capacity lower bound)
Consider a compact subset of with positive capacity and . Then, one has
[TABLE]
Moreover, for any one has
[TABLE]
(* varies over the collection of compact sets of positive capacity in the infimum).*
Proof.
We begin with (3.15). Note that the quantity under the is non-increasing in , so the limit exists. We first prove that it is at least . Denote by the Brownian Green function on (which is known to be symmetric), and for compact subset of , let and respectively stand for the equilibrium measure and the equilibrium potential of . Then (see for instance [18], p. 58 or Chapter 2 §3 and §4 of [20]), one has
[TABLE]
and on except on a set of zero capacity. Moreover, is supported by , has total mass , and does not charge sets of zero capacity.
Now for as above (3.15), for , , , , and , we have
[TABLE]
where the second equality in the second line of (3.18) follows from the fact that the set of irregular points for which , has zero capacity and hence null -measure.
Thus, , and taking the infimum in the right member over , , , and letting tend to zero, we see that the limit in (3.15) is at least by (3.3) of Theorem 3.1.
To show that it equals , denote by the set of points at sup-distance at most from . Then for , choosing , we see that and . In addition, as , cf. [18], p. 60. Letting go to [math] and to in such a way that tends to [math], the limit in (3.15) is at most .
We now turn to the proof of (3.16). A similar monotonicity argument as in the proof of (3.15) shows the existence of the limit. This limit is at most equal to the limit in (3.15) (with an arbitrary compact set of positive capacity) and thus is at most . The limit is also bigger or equal to as we now explain. Indeed, as above one has , and it now follows from (3.3) and the maximality of the case that the limit in (3.16) is at least . This concludes the proof of (3.16), and hence of Corollary 3.4. ∎
We also state an immediate consequence of Theorem 3.1 in the case of soft obstacles concerning the time spent by Brownian motion in the -neighborhood of , for any . We recall that stands for the sup-distance of to (see the beginning of Section 1).
Corollary 3.5**.**
For any non-empty compact set in , and ,
[TABLE]
Proof.
We write , and note that in the notation of (3.2) , where (see (1.20) for notation). The claim now follows from (3.4) of Theorem 3.1. ∎
Remark 3.6**.**
- We briefly sketch here an example showing that the interfaces and porous interfaces under consideration may undergo degenerations in certain parts of space, where they may become brittle and have little trapping power (see Fig. 4 below).
We consider , , , where , so that
[TABLE]
We let denote the cable graph consisting of solid segments between neighboring sites in . We also consider the discrete set of sites placed at regular spacings along each solid edge of . We endow with its natural graph structure and set .
We consider (fixed) and assume that (the “porous interface”) is such that coincides with the restriction of to (where stands for the closed Euclidean ball of center and radius ). One can arrange so that for a suitable and (depending on ). For instance, one can consider some spanning tree of rooted at a point on the inner boundary of in , and let behave in the -neighborhood of as a “cactus-like” structure thickening this spanning tree with thin tubes of radius with a stem hanging out at the root.
\psfrag{s}{}\psfrag{e}{}\psfrag{A}{}\psfrag{S}{}\psfrag{U0}{}\psfrag{U1}{}\psfrag{2ell}{}\psfrag{AN}{}\psfrag{SN}{}\psfrag{L0}{\small{}}\psfrag{LaN}{\small{ slightly smaller than }}\psfrag{Lsk}{\small{ slightly bigger than }}\psfrag{re}{}\psfrag{e}{}\psfrag{x}{}\includegraphics[width=227.62204pt]{fig4.eps}
[TABLE]
We then consider , the set of points at Euclidean distance from and sup-distance at most from the middle-point of a solid segment of contained in . As we now explain, for some constants and ,
[TABLE]
and has little trapping power on Brownian motion starting in .
To see (3.21), denote by the set of points at Euclidean distance at least from . As we now explain, one has a constant such that
[TABLE]
Indeed, to each in , one can attach a unique solid segment of , and taking as origin the middle of the segment, one can decompose Brownian motion into a -dimensional motion parallel to the segment and a -dimensional motion transversal to the segment. One can make sure that the -dimensional component reaches radius before time and reaching radius with a non-degenerate probability. One can also force the -dimensional component not to move by more than from its starting point up to time , with non-degenerate probability. The lower bound (3.22) now follows by independence.
Then, for and , we have
[TABLE]
The strong Markov property combined with (3.22) and (3.23) now yields (3.21). Although we will not need it, let us mention that a more detailed analysis of the above example along the lines of the constant capacity regime of small obstacles (see for instance [1], [5], and also [20], p. 116-120) would reveal that can be chosen equal to in (3.21), but that one does indeed feel when starting in , in the sense that .
- In Theorem 3.1, when , scaling can be applied to reformulate (3.3) and (3.4). Indeed, for any , is equivalent to . Moreover, given , for , , then is equivalent to and . Likewise, is equivalent to , and
[TABLE]
As a result, when , (3.3) can be restated as
[TABLE]
and (3.4) can be restated as
[TABLE]
- In the context of Corollary 3.4 the situation is typically simpler when is a convex set. If denotes the projection on , then is a contraction for the Euclidean distance. If is a porous interface and , then one knows that , see [12], p. 58, or [17], p. 126. In good cases satisfies a Wiener criterion (see for instance [20], p. 72), which quantifies that is felt on many scales when starting from , and permits one to show that is close to . One can then infer from this fact a lower bound on .
4 Disconnection
We will now apply the results of the previous section, specifically Corollary 3.4, to derive large deviation upper bounds on the probability that random interlacements in , when their vacant set is in a strongly percolative regime, or the simple random walk disconnect a large macroscopic body from the boundary of a large box of comparable size, which contains this body, cf. Theorem 4.1, Corollary 4.4, and Remark 4.5 3). The macroscopic body in question will correspond to the discrete blow-up of a compact set in , with non-empty interior, see (4.4), and also Remark 4.5 3) for a variant of this set-up. The main novelty compared to [22], where was itself a box, and the method could plausibly have been adapted to the case of a regular compact convex set , is that here we do not require any convexity assumption on . The interfaces and the porous interfaces will arise in the context of a coarse graining procedure, which underlies the large deviation upper bounds that we derive, see (4.48), (4.49).
We briefly introduce some notation concerning random interlacements, and refer to the end of Section 1 of [22] and the references therein for more details. Throughout we assume . The random interlacements , and the corresponding vacant sets are defined on a certain probability space . In essence, corresponds to the trace left on by a certain Poisson point process of doubly infinite trajectories modulo time-shift that tend to infinity at positive and negative infinite times, with intensity proportional to . As grows, becomes thinner and it is by now well-known (see for instance [4], [9]) that there is a critical level such that
[TABLE]
One can further introduce critical values
[TABLE]
(the event under the probability corresponds to the existence of a nearest neighbor path in between and the exterior boundary of ).
We refer to (2.3) of [22] for the precise definition of . It is known to be positive thanks to Theorem 1.1. of [10] (and also [23], when ). The ranges and respectively correspond to strongly non-percolative and strongly percolative regimes of the vacant set . It is plausible but open at the moment that actually .
We are interested here in the strongly percolative regime for the vacant set . We consider
[TABLE]
and we assume that is such that
[TABLE]
Given , the discrete blow-up of is defined as
[TABLE]
and we write
[TABLE]
We note that for large , i.e. ,
[TABLE]
Our interest lies in the disconnection event
[TABLE]
(corresponding to the absence of a nearest neighbor path in between and ), and we tacitly assume from now on that . The main result of this section is the following asymptotic upper bound.
Theorem 4.1**.**
Assume that is a compact subset of and satisfies (4.5). Then, for , one has (with the interior of )
[TABLE]
Of course, when the compact set is regular in the sense that , one can replace by in the right member of (4.10). Theorem 4.1 has a direct application that yields a similar asymptotic upper bound on the probability that simple random walk disconnects from , see Corollary 4.4 at the end of this section.
Before starting the proof of Theorem 4.1, we introduce some further notation and recall three results from [22]. We consider , as well as
[TABLE]
(the parameter corresponds to in [22], but we use here a different notation to avoid a confusion with the parameter of Section 3). We consider from now on an integer (, this constant corresponds as below (6.4) of [22] to , in the notation of Theorem 2.3, Proposition 3.1 and Theorem 5.1 of [22]). We also consider an integer , and for any , we set
[TABLE]
We refer to (2.11) - (2.13) of [22] for the notion of a good-box (which is otherwise bad). The details of the definition will not be important here. In essence, one looks at the excursions of the interlacements between and the complement of . One can order them in a natural fashion, and for a good-box , the complement of the first excursions leaves in a connected set with sup-norm diameter at least , which is connected to similar components in neighboring boxes of via paths in avoiding the first excursions (and stands for the capacity attached to the simple random walk on ). In addition, the first excursions spend a substantial “local time” on the (inner) boundary of , which is at least .
We also need the notation , see (2.14) of [22], which refers to the number of excursions from to (the exterior boundary of in , contained in the interlacement trajectories up to level .
We now recall three facts from [22]. First, a connectivity statement, cf. Lemma 6.1 of [22]:
[TABLE]
Second, an exponential bound, cf. Theorem 3.2 of [22], namely, if is a non-empty finite subset of with points at mutual sup-distance at least , where , then
[TABLE]
where (and does not depend on by translation invariance). The third fact, cf. (5.1) of [22] (with the choice ), as well as (5.6) and Theorem 5.1 of [22], is a super-exponential bound (its proof in [22] uses decoupling via the soft local time technique in the form of Section 2 of [6]). Namely, there exists a positive function (depending on ) with , such that setting
[TABLE]
where for vector of the canonical basis of , a column in in the direction refers to the collection of -boxes intersecting with same projection on the discrete hyperplane , and (4.16) holds for all vectors of the canonical basis.
It is convenient to introduce the non-increasing function
[TABLE]
We will now specify the choice of as a function of (that enters Theorem 4.1). We do this in a different fashion from [22] (we use here a slightly bigger scale). First, we choose a positive sequence , , such that
[TABLE]
(such a choice is possible since .
We then define ( will stand for our choice of as a function of )
[TABLE]
By (4.18) iii) for large , is smaller than . Heuristically, can be thought of as “nearly macroscopic” (i.e. of size ). As an aside, (which is comparable to for large ) will in essence correspond to the parameter of Section 3. Together with these choices, we introduce the lattices
[TABLE]
As a last preparation for the proof of Theorem 4.1, we have
Lemma 4.2**.**
As , one has in the notation of (4.15), (4.19)
[TABLE]
In addition, if one defines the event (where runs over the canonical basis of ),
[TABLE]
then one has
[TABLE]
Proof.
We first prove (4.21). For large , on the one hand, we have
[TABLE]
and on the other hand
[TABLE]
Since tends to zero, cf. (4.18) iv) and , the claim (4.21) follows from (4.24), (4.25).
We now turn to the proof of (4.23). We note that for large , one has
[TABLE]
Hence, for large the event is contained in the union over of the events under the probability in (4.16) where replaces . In addition, by (4.26), we know that for large and (4.23) follows from (4.16). This completes the proof of Lemma 4.2. ∎
We are now ready to begin the proof of Theorem 4.1. Here is an outline of the proof. We use a coarse graining procedure. In essence, for large , on the disconnection event , cf. (4.9), there will be an interface of -boxes, either bad or with , blocking the way between and the complement of . We will track this interface through boxes of size (much larger than , but small compared to the macroscopic size ), where the interface will have a substantial presence. This step will involve the inspection of a certain local density in scale , cf. (4.28), and selecting a region where it is non-degenerate, cf. (4.32). After discarding the bad event , which is negligible for our purpose, thanks to the super-exponential bound (4.23), there will be few bad -boxes in each -boxes, and we will be able to extract a “porous interface” made of boxes of size , so that in each such box there will be a substantial presence of boxes of size , all good, with , at mutual distance at least (with as required in (4.14)). This selection of -boxes will use isoperimetric controls of Deuschel and Pisztora [8] based on an elementary inequality of Loomis and Whitney [16], in a similar spirit as in Section 2 of [7]. These choices will have a small combinatorial complexity, namely , and will produce a coarse graining of the event . By the exponential bound (4.14), we will then be reduced to the derivation of a uniform lower bound on , for the union of the selected -boxes. With the help of Proposition A.1 of the Appendix, we will be able to replace discrete boxes and random walk capacity with -boxes and Brownian capacity (first letting tend to infinity, and then choosing large). The desired uniform lower bound on the capacity will be provided by Corollary 3.4, where in essence corresponds to (). The bound in Theorem 4.1 will then follow by letting tend to infinity, and then letting successively go to zero and (together with ) go to .
Proof of Theorem 4.1: We recall the definitions of and in (4.19). Without loss of generality we assume that (otherwise (4.10) is immediate) and that so that (4.8) holds. We are going to introduce a local density function , see (4.28) below, in order to track in scale an interface of “blocking -boxes”, when occurs. More precisely, we introduce the random subset
[TABLE]
We then define the local density function
[TABLE]
We note that has slow variation in the sense that
[TABLE]
When , any -box intersecting is contained in and hence in , so that
[TABLE]
On the other hand, when , any -box intersecting is contained in . When is large, if such a box is contained in , then by (4.27) and the connectivity property (4.13), there is a path in between und and does not occur. So, we find that
[TABLE]
Loosely speaking, the random set that we will now introduce, provides a “segmentation” in (nearly macroscopic) scale of the interface of blocking (and much smaller) -boxes we are interested in. Specifically, we consider the random subset of (see (4.20) for notation)
[TABLE]
as well as the compact subset of
[TABLE]
(in essence, the unbounded component of the complement of will play the role of in the first three sections of this article, see (4.49) below).
The Reader may possibly wish to read the statement of the next lemma, first skip its proof, and proceed above (4.39) to see how the proof of Theorem 4.1 unfolds.
Lemma 4.3**.**
(Insulation property of )
For large ,
[TABLE]
and on ,
[TABLE]
Proof.
By (4.30), we see that for large , , when , and (4.34) follows. To prove (4.35), we will first show that
[TABLE]
Indeed, otherwise scaling up by and choosing some point in within -distance of the intersection, we could find with and within -distance of . This would imply by (4.31). But also by (4.32) and (4.29) that , a contradiction. This proves the claim (4.36).
As a next step in the proof of (4.35), we will show that
[TABLE]
This will imply that any continuous path in starting in the compact set in (4.35) and with end point of -norm at least necessarily meets . Together with (4.36), this will complete the proof of (4.35). There remains to prove (4.37).
Given as in (4.37), we can construct a -valued -path (i.e. , for ) such that ; and and is contained in the closed -neighborhood of ) for the -distance. Indeed, one constructs by induction a non-decreasing sequence of times and points , so that is the first time after (with ) when the continuous path moves at -distance from the current point of the sequence to choose the next in so that and . The procedure stops after finitely many steps (by the continuity of ) with a point that satisfies (whence ).
It now follows from (4.30) and (4.31) that and . In addition, , for , and by (4.29), we find that necessarily for some , one has .
For large , if we now choose such that , cf. (4.20), we find that
[TABLE]
This shows that belongs to , cf. (4.32). In addition, comes within -distance of , and thus of . This yields (4.37) and concludes the proof of Lemma 4.3. ∎
We are now on our way to introduce a coarse graining of the event (we refer to (4.22) for the definition of the “bad” event ), see (4.42), (4.43) below. As a next step, we extract a (measurable random) subset of the (measurable random) finite set such that:
[TABLE]
For any , we have by (4.32). By the isoperimetric controls (A.3) - (A.6), p. 480-481 of [8], we have a projection on the hyperplane of points with vanishing -coordinate, such that the -image of the points in having a neighbor in has cardinality at least (see (4.27) for notation). Any such point in , which is a neighbor of a point in , belongs to a (uniquely defined) -box , , which is not contained in (otherwise the point would belong to ), but also cannot be both good and with (otherwise the point would again belong to , since a neighboring -box is contained in ).
As a result, we see that for large ,
[TABLE]
Now for large , on the complement of the event in (4.22), in each coordinate direction, the number of columns of -boxes in that contain a bad -box is at most by (4.21). This observation combined with (4.40) shows that
[TABLE]
Thus, for large , we can define a random variable
[TABLE]
with the above mentioned properties. As we now explain
[TABLE]
Indeed, for large , by (4.34), (4.39), there are at most possible choices for the couple , and this quantity is at most
[TABLE]
Then, for any such choice of and , for any , we can choose in at most ways, and hence the number of choices for is at most
[TABLE]
Note that for large , one has
[TABLE]
We thus find that for large , the number of possible values of is at most , whence (4.43).
For large , the coarse graining of will specifically correspond to the partition:
[TABLE]
We can now combine the super-exponential bound in (4.23) and the above coarse graining to find that
[TABLE]
To each , we will associate a “segmentation” (corresponding to or in (4.49) below) and a “porous interface” (corresponding to in (4.48) below), as follows. If , we define
[TABLE]
its “scaled -filling”:
[TABLE]
as well as
[TABLE]
Note that on the open set coincides with the unbounded component of in the notation of (4.33). Thus, by Lemma 4.3, for large and all in , on , the compact set in (4.35) of Lemma 4.3 does not intersect . We then consider a compact subset of and some such that, for large and all ,
[TABLE]
In addition, by (4.39), (4.41), and the definition of in (4.48), that for large and all and , {\rm cap}(\mbox{\footnotesize\displaystyle\bigcup,!!{z\in\widetilde{{\cal C}}{x}}}\;z+[0,L_{0}]^{d})\geq c(K)\widehat{L}_{0}^{d-2} (using a projection argument, see [17], p. 126), and
[TABLE]
This will enable us to apply Corollary 3.4 of the previous section. We now come back to (4.46), and note that by the exponential bound (4.14), as well as our choice of in (4.41) and the notation (4.47),
[TABLE]
Taking a liminf over and using Proposition A.1, we find with as in (4.48):
[TABLE]
We can now take (4.50), (4.51) into account, and by Corollary 3.4, we find that
[TABLE]
Inserting this inequality in the last expression of (4.53), and letting successively tend to zero and tend to yields
[TABLE]
Letting increase to now yields (4.10), by Proposition 1.13, p.60 of [18]. This completes the proof of Theorem 4.1.
In the proof of the above Theorem 4.1, we applied Corollary 3.4 with a fixed , which does not vary with , see (4.50). We refer to Remark 4.5 3) below for an application where depends on .
Theorem 4.1 has an immediate application to a similar asymptotic upper bound in the case of disconnection by a simple random walk. We first introduce some notation. We denote by , , the canonical simple random walk on , (recall ), and by the canonical law of the walk starting at . We write for the set of points visited by the walk and for its complement. With and as in (4.6), (4.7), and such that , we consider the disconnection event where there is no path in between and ,
[TABLE]
We have
Corollary 4.4**.**
Assume that is a compact subset of and satisfies (4.5), then for any ,
[TABLE]
Proof.
The proof is similar to that of Corollary 6.4 of [22] (or that of Corollary 7.3 of [21]) and relies on the fact that one can find a coupling of under and of under , so that -a.s., . The claim (4.57) then follows by the application of Theorem 4.1 to , and then letting (see the above mentioned references for details). ∎
Remark 4.5**.**
-
The approach developed in this section should remain pertinent in the context of level-set percolation of the Gaussian free field on , . Plausibly, one should be able to adapt the strategy of the proof of Theorem 4.1 to instead derive asymptotic upper bounds on the probability that the excursion-set of the Gaussian free field below level disconnects the macroscopic body from , when is such that the excursion-set of the Gaussian free field above is in a strongly percolative regime (i.e. in the notation of [21]). The case when is the discrete blow-up of a box centered at the origin was treated in [21].
-
As mentioned in the introduction, it is plausible but presently open that the critical levels actually coincide (incidentally, some progress towards a possible proof of the equality has been made in [11]). If this is the case and , then when the compact set is regular in the sense that
[TABLE]
the asymptotic upper bounds in Theorem 4.1 and Corollary 4.4 respectively match the asymptotic lower bounds from [15] in the case of random interlacements, and from [14] in the case of simple random walk and under (4.58)
[TABLE]
- Assume that for each rationals in , and integer (in the notation below (4.11)) one chooses a positive sequence as in (4.18). Then, the proof of Theorem 4.1 can straightforwardly be adapted to the situation where in place of in (4.6) one considers the discrete blow-up with the closed -neighborhood in -distance of the compact set , for a sequence in such a fashion that (i.e. ), for all above choices of . Such a sequence can for instance be constructed by a diagonal procedure. In essence, one only needs to replace by and by in (4.35), and then by and by the smallest non-negative integer such that in (4.50) (so tends to zero with ). If one denotes by and the disconnection events respectively corresponding to (4.9) and (4.56) with in place of , one obtains that for any compact set in and such that (4.5) holds
[TABLE]
Appendix A Appendix
In this appendix we state and prove Proposition A.1 that provides a uniform comparison between the discrete capacity of arbitrary finite unions of discrete -boxes at mutual distance with the Brownian capacity of their -filling, when both and tend to infinity.
We first introduce some notation and recall some facts. We write , with , for the Green function of the simple random walk on , . If we set , , and , (with the Green function of Brownian motion), so that , for , and , for , then one knows by [13], p. 31, that
[TABLE]
We consider integers and and recall the notation from (4.12) concerning -boxes: , for . For , a non-empty finite subset of , we write
[TABLE]
We denote by the -filling of :
[TABLE]
and set
[TABLE]
Of special interest for this appendix is the case when the boxes in are at mutual distance at least , i.e.
[TABLE]
For finite subset of , we let and stand for the respective equilibrium measure and capacity of attached to the discrete Green function (so in the notation of Section 4). One knows that when is large and (A.5) holds, the equilibrium measure of “conditioned on being in the -box ”, it is very close to the normalized equilibrium measure .
More precisely, by Proposition 1.5 of [22], for any , when ,
[TABLE]
Finally, we recall that in the case of an -box and its -filling , one has the large equivalence of capacities, cf. Lemma 2.2 of [2] and [19], p. 301, namely
[TABLE]
The main object of this Appendix is the following strengthening of this asymptotic equivalence:
Proposition A.1**.**
[TABLE]
where in (A.8) and (A.9), varies over the collection of non-empty finite subsets of satisfying (A.5).
Proof.
We consider and assume so that (A.6) holds. We also introduce the quantity (recall the notation (A.3))
[TABLE]
and note that by (A.1)
[TABLE]
We now consider , a non-empty subset of satisfying (A.5), as well as in (A.6) and the finite measure on :
[TABLE]
(and stands for the normalized equilibrium measure of the -filling of , i.e. ).
For (see (A.4)), so that with , we choose , such that . We then have
[TABLE]
The first term in the right-hand side of (A.13) equals (see (A.7) for notation) .
By (A.10), (A.11), we see that on the one hand
[TABLE]
In a similar fashion, we see that
[TABLE]
Note that is supported by , see (A.12), and (A.15) holds for arbitrary in . It then follows by integration of (A.14) and (A.15) with respect to the equilibrium measure of that
[TABLE]
Since is arbitrary, the claims (A.8) and (A.9) readily follow by (A.7) and (A.11). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.R. Baxter and N.C. Jain. Asymptotic capacities for finely divided bodies and stopped diffusions. Illinois J. Math. , 31(3):469–495, 1987.
- 2[2] E. Bolthausen and J.D. Deuschel. Critical large deviations for Gaussian fields in the phase transition regime. Ann. Probab. , 21(4):1876–1920, 1993.
- 3[3] R. Cerf. Large deviations for three dimensional supercritical percolation. Astérisque 267, Société Mathématique de France, 2000.
- 4[4] J. Černý and A. Teixeira. From random walk trajectories to random interlacements. Sociedade Brasileira de Matemática , 23:1-78, 2012.
- 5[5] D. Cioranescu and F. Murat. Un terme étrange venu d’ailleurs. In Nonlinear partial differential equations and their applications , volume 2, pages 98–132. Coll. de France Semin., 1982.
- 6[6] F. Comets, Ch. Gallesco, S. Popov, and M.Vachkovskaia. On large deviations for the cover time of two-dimensional torus. Electron. J. Probab. , 96:1–18, 2013.
- 7[7] A. Dembo and A.S. Sznitman. On the disconnection of a discrete cylinder by a random walk. Probab. Theory Relat. Fields , 136(2):321-340, 2006.
- 8[8] J.D. Deuschel and A. Pisztora. Surface order large deviations for high-density percolation. Probab. Theory Relat. Fields , 104(4):467–482, 1996.
