2018
DOI: 10.30757/alea.v15-38
|View full text |Cite
|
Sign up to set email alerts
|

Conditional decoupling of random interlacements

Abstract: Abstract. We prove a conditional decoupling inequality for the model of random interlacements in dimension d ≥ 3: the conditional law of random interlacements on a box (or a ball) A 1 given the (not very "bad") configuration on a "distant" set A 2 does not differ a lot from the unconditional law. The main method we use is a suitable modification of the soft local time method of [13], that allows dealing with conditional probabilities.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…They provide a connection between the measures P u with different values of the parameter and serve only to prove the likeliness of certain patterns in S ∞ , cf. [27, Remark 1.9 (1)]. More precisely, if an increasing, resp.…”
Section: Proof Of Lemma 56mentioning
confidence: 99%
See 1 more Smart Citation
“…They provide a connection between the measures P u with different values of the parameter and serve only to prove the likeliness of certain patterns in S ∞ , cf. [27, Remark 1.9 (1)]. More precisely, if an increasing, resp.…”
Section: Proof Of Lemma 56mentioning
confidence: 99%
“…The fundamental idea behind the major progress in understanding these models (which are monotone in their intensity parameters) is that the effect of correlations can be well dominated with a slight tilt of the intensity parameter (sprinkling). This idea is formalized in correlation inequalities, known as decoupling inequalities [31,32,26,10,21,22,1]. A general class of percolation models, which satisfy a suitable decoupling inequality and contains the three models mentioned above, was considered in [8,23,27], where most of the geometric properties of the infinite percolation cluster, previously only known to hold for Bernoulli percolation, were proven.…”
mentioning
confidence: 99%
“…k records the successive steps of the SRW S in the ith direction. Obviously, we have that S (1) , S (2) and S (3) are independent (the same is not true for S(i) ).…”
Section: Lemma 24mentioning
confidence: 97%
“…and we define T (x, M, n) = T (1) (x, M, n) ∩ T (2) (x, M, n) ∩ T (3) (x, M, n). Not focusing, for now, on technicalities, the key part of the event T (x, M, n) is that, not far away from x in the direction of the drift, there is a structure in I u creating a dead end for the biased random walk.…”
Section: Trapsmentioning
confidence: 99%
See 1 more Smart Citation