Critical probabilities of 1-independent percolation models
Abstract
Given a locally finite connected infinite graph G, let the interval [p min(G), p max(G)] be the smallest interval such that if p > p max(G), then every 1-independent bond percolation model on G with bond probability p percolates, and for p < p min(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in particular for lattices. © 2012 Cambridge University Press.
Publication Title
Combinatorics Probability and Computing
Recommended Citation
Balister, P., & Bollobás, B. (2012). Critical probabilities of 1-independent percolation models. Combinatorics Probability and Computing, 21 (1-2), 11-22. https://doi.org/10.1017/S0963548311000538
COinS
