Open Access
Translator Disclaimer
2014 Bernoulli and self-destructive percolation on non-amenable graphs
Daniel Ahlberg, Vladas Sidoravicius, Johan Tykesson
Author Affiliations +
Electron. Commun. Probab. 19: 1-6 (2014). DOI: 10.1214/ECP.v19-2611


In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is adapted to show that for a large class of non-amenable graphs, the graph obtained by removing each site contained in an infinite percolation cluster has critical percolation threshold which can be arbitrarily close to the critical threshold for the original graph, almost surely, as $p\searrow p_c$. Closely related is the self-destructive percolation process, introduced by J. van den Berg and R. Brouwer, for which we prove that an infinite cluster emerges for any small reinforcement.


Download Citation

Daniel Ahlberg. Vladas Sidoravicius. Johan Tykesson. "Bernoulli and self-destructive percolation on non-amenable graphs." Electron. Commun. Probab. 19 1 - 6, 2014.


Accepted: 12 July 2014; Published: 2014
First available in Project Euclid: 7 June 2016

zbMATH: 1310.60137
MathSciNet: MR3233202
Digital Object Identifier: 10.1214/ECP.v19-2611


Back to Top