Bernoulli and self-destructive percolation on non-amenable graphs
From MaRDI portal
(Redirected from Publication:457793)
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.
Recommendations
- Self‐destructive percolation
- Critical percolation on any nonamenable group has no infinite clusters
- Percolation on nonunimodular transitive graphs
- Critical percolation on certain nonunimodular graphs
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
Cited in
(10)- Linear lower bounds for \(\delta _c(p)\) for a class of \(2D\) self-destructive percolation models
- Self‐destructive percolation
- Some toy models of self-organized criticality in percolation
- Frozen percolation on the binary tree is nonendogenous
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Seven-dimensional forest fires
- Self-destructive percolation as a limit of forest-fire models on regular rooted trees
- Planar lattices do not recover from forest fires
- Frozen percolation in two dimensions
- Linear de-preferential urn models
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)
