Ergodicity and indistinguishability in percolation theory

DOI10.4171/LEM/61-3/4-2zbMath1353.82034arXiv1210.1548MaRDI QIDQ330020

Sébastien Martineau

Publication date: 24 October 2016

Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

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

zbMATH Keywords

ergodicitypercolationCayley graphsindistinguishabilitystrong ergodicityorbit equivalence relation

Mathematics Subject Classification ID

Percolation (82B43) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Dynamical aspects of statistical mechanics (37A60)

Related Items (5)

Indistinguishability of collections of trees in the uniform spanning forest ⋮ Heavy Bernoulli-percolation clusters are indistinguishable ⋮ A nonamenable ``factor of a Euclidean space ⋮ Invariant tilings and unimodular decorations of Cayley graphs ⋮ Harmonic models and Bernoullicity

This page was built for publication: Ergodicity and indistinguishability in percolation theory