Uniqueness and non-uniqueness in percolation theory.
Häggström, Olle, Jonasson, Johan (2006)
Probability Surveys [electronic only]
Similarity:
Häggström, Olle, Jonasson, Johan (2006)
Probability Surveys [electronic only]
Similarity:
Olle Häggström, Yuval Peres, Jeffrey E. Steif (1997)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Peres, Yuval, Pete, Gábor, Scolnicov, Ariel (2006)
The New York Journal of Mathematics [electronic only]
Similarity:
Benjamini, Itai, Schramm, Oded (1996)
Electronic Communications in Probability [electronic only]
Similarity:
Jonasson, Johan (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Aldous, David J., Lyons, Russell (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Gady Kozma (2011)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
Cui, Qing (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuval Peres, Oded Schramm, Jeffrey E. Steif (2009)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of bounded degree graphs, one which percolates for all times at criticality and one which has...