2021
DOI: 10.48550/arxiv.2101.05801
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Critical exponents for a percolation model on transient graphs

Abstract: We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the field on the one hand, and the links with potential theory for the associated diffusion on the other, we rigorously determine the behavior of various key quantities related to the (near-)critical regime for this model. In particular, our results apply in case the base graph i… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 38 publications
(100 reference statements)
0
6
0
Order By: Relevance
“…Let us mention that both decays (1.16) and (1.17) have been proved for the discrete GFF on certain graphs [28,14,11,34,27,26]. We now discuss some aspects of our global comparison theorem.…”
Section: Open Questionsmentioning
confidence: 83%
“…Let us mention that both decays (1.16) and (1.17) have been proved for the discrete GFF on certain graphs [28,14,11,34,27,26]. We now discuss some aspects of our global comparison theorem.…”
Section: Open Questionsmentioning
confidence: 83%
“…We will then use killed or surviving interlacements to give a first illustration of the independent interest of these results, see Corollaries 3.4, 6.9 and 6.11. We refer to Section 6 in [13] for an example of a proof where killed interlacements and killed-surviving interlacements play an essential role.…”
Section: Notation and Definitionmentioning
confidence: 99%
“…This model often undergoes a phase transition at level zero, which was first proved in [22] on Z d , d ≥ 3, then on trees in [35] and [1], and later on a large class of transient graphs, possibly with positive killing measure, in [12]. In many cases, this phase transition is also particularly well understood in the near-critical regime, see [9] on Z d , d ≥ 3, or the recent paper [13] for additional results on general graphs. We will prove that this behaviour of the phase transition, although typical, cannot be extended to any transient weighted graph.…”
mentioning
confidence: 92%
“…Interestingly, in the case of the cable graph on Z d the corresponding function θG 0 is explicit. The critical level is 0 and θG 0 (h) = 2Φ(h ∧ 0), for h ∈ R, where Φ denotes the distribution function of a centered Gaussian variable with variance g(0, 0), see Corollary 2.1 of [12]. However, in the case of Z d , d = 3, the simulations in Figure 4 of [21] suggest a behavior of θ G 0 close to the critical level h * different from that of θG 0 near the critical level 0.…”
Section: A Appendix: Resonance Sets and I-familiesmentioning
confidence: 99%