scientific article; zbMATH DE number 1405898
From MaRDI portal
Publication:4938894
zbMath0948.60098MaRDI QIDQ4938894
Yuval Peres, Roberto H. Schonmann, Olle Häggström
Publication date: 3 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
percolationcritical pointstransitive graphsuniqueness of infinite clusterends of infinite clustersindistinguishability of infinite clusters
Related Items (23)
The Ising model on diluted graphs and strong amenability ⋮ The scaling limits of the minimal spanning tree and invasion percolation in the plane ⋮ Invasion percolation on Galton-Watson trees ⋮ Minimal spanning forests ⋮ Neighboring clusters in Bernoulli percolation ⋮ Percolation on nonunimodular transitive graphs ⋮ Surviving ends in Bernoulli percolation on graphs roughly isometric to a tree ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Heavy Bernoulli-percolation clusters are indistinguishable ⋮ Percolation on infinite graphs and isoperimetric inequalities ⋮ Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters ⋮ Some toy models of self-organized criticality in percolation ⋮ Limit theorems for 2D invasion percolation ⋮ Exponential growth of ponds in invasion percolation on regular trees ⋮ Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs ⋮ Recent advances in percolation theory and its applications ⋮ Percolation on hyperbolic graphs ⋮ Invasion percolation on regular trees ⋮ Ends in free minimal spanning forests ⋮ On the cluster size distribution for percolation on some general graphs ⋮ Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution ⋮ Random spatial growth with paralyzing obstacles ⋮ Counterexamples for percolation on unimodular random graphs
This page was built for publication:
