Kesten’s incipient infinite cluster and quasi-multiplicativity of crossing probabilities
Electronic Communications in Probability · 01.01.2017 · 22 (none) · 1-12
DOI: 10.1214/17-ecp56 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Communications in Probability, erschienen am 01.01.2017. Verfasst von Deepan Basu und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 23 Literaturangaben.
Abstract (Originalsprache)
In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of Kesten’s incipient infinite cluster. We show that our assumptions are satisfied if $G$ is a slab $\mathbb{Z} ^2\times \{0,\ldots ,k\}^{d-2}$ ($d\geq 2$, $k\geq 0$). We also argue that the quasi-multiplicativity assumption should hold for $G=\mathbb{Z} ^d$ when $d6$.
Zitieren
APA
Basu, D., & Sapozhnikov, A. (2017). Kesten’s incipient infinite cluster and quasi-multiplicativity of crossing probabilities. Electronic Communications in Probability, 22(none), 1-12. https://doi.org/10.1214/17-ecp56
Vancouver
Basu D, Sapozhnikov A. Kesten’s incipient infinite cluster and quasi-multiplicativity of crossing probabilities. Electronic Communications in Probability. 2017;22(none):1-12. doi:10.1214/17-ecp56
BibTeX
@article{Basu2017,
author = {Basu, Deepan and Sapozhnikov, Artem},
title = {Kesten’s incipient infinite cluster and quasi-multiplicativity of crossing probabilities},
journal = {Electronic Communications in Probability},
year = {2017},
volume = {22},
number = {none},
pages = {1--12},
doi = {10.1214/17-ecp56}
}
EUVIMED