Indistinguishability of percolation clusters

From MaRDI portal
Publication:1577738

DOI10.1214/aop/1022677549zbMath0960.60013arXivmath/9811170OpenAlexW2950378210MaRDI QIDQ1577738

Russell Lyons, Oded Schramm

Publication date: 13 May 2001

Published in: The Annals of Probability (Search for Journal in Brave)

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




Related Items

Explicit isoperimetric constants and phase transitions in the random-cluster modelMixed percolation as a bridge between site and bond percolation.The Ising model on diluted graphs and strong amenabilityIndistinguishability of trees in uniform spanning forestsPercolation on finite graphs and isoperimetric inequalities.A measurable-group-theoretic solution to von Neumann's problemPercolation and isoperimetry on roughly transitive graphsHomology-changing percolation transitions on finite graphsTwo badly behaved percolation processes on a nonunimodular graphApproximations of standard equivalence relations and Bernoulli percolation at \(p_u\)Minimal spanning forestsIndistinguishability of the components of random spanning forestsNeighboring clusters in Bernoulli percolationIndistinguishability of collections of trees in the uniform spanning forestCylinders' percolation in three dimensionsA factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labelsHeavy Bernoulli-percolation clusters are indistinguishableStrict monotonicity of percolation thresholds under covering mapsIsing percolation in the hyperbolic planeContinuity of the Ising phase transition on nonamenable groupsLocality of random digraphs on expandersSlightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clustersPhase transition for percolation on a randomly stretched square latticeRefinements of stochastic dominationInsertion-tolerance and repetitiveness of random graphsNonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphsPercolation beyond \(\mathbb Z^{d}\): the contributions of Oded SchrammFinitary random interlacements and the Gaboriau-Lyons problemPercolation on hyperbolic graphsColoring percolation clusters at random.Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)Ends in free minimal spanning forestsThe component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)The \(L^2\) boundedness condition in nonamenable percolationSupercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distributionA nonamenable ``factor of a Euclidean spacePlanar stochastic hyperbolic triangulationsCritical percolation on any nonamenable group has no infinite clustersCounterexamples for percolation on unimodular random graphsInvariant tilings and unimodular decorations of Cayley graphsShift-coupling of random rooted graphs and networksHyperbolic and parabolic unimodular random mapsKazhdan groups have cost 1