Bernoulli and self-destructive percolation on non-amenable graphs

From MaRDI portal
Publication:457793

DOI10.1214/ECP.V19-2611zbMATH Open1310.60137arXiv1302.6870OpenAlexW2118221539MaRDI QIDQ457793FDOQ457793


Authors: Daniel Ahlberg, Johan Tikesson, Vladas Sidoravicius Edit this on Wikidata


Publication date: 29 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: 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 approaches 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.


Full work available at URL: https://arxiv.org/abs/1302.6870




Recommendations





Cited In (10)





This page was built for publication: Bernoulli and self-destructive percolation on non-amenable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457793)