Ergodicity and indistinguishability in percolation theory

DOI10.4171/LEM/61-3/4-2zbMATH Open1353.82034arXiv1210.1548MaRDI QIDQ330020FDOQ330020

Authors: Sébastien Martineau 

Publication date: 24 October 2016

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

Abstract: This paper explores the link between the ergodicity of the clus-ter equivalence relation restricted to its infinite locus and the indis-tinguishability of infinite clusters. It is an important element of the dictionary connecting orbit equivalence and percolation theory. This note starts with a short exposition of some standard material of these theories. Then, the classic correspondence between ergodicity and in-distinguishability is presented. Finally, we introduce a notion of strong indistinguishability that corresponds to strong ergodicity, and obtain that this strong indistinguishability holds in the Bernoulli case. We also define an invariant percolation that is not insertion-tolerant, sat-isfies the Indistinguishability Property and does not satisfy the Strong Indistinguishability Property.

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

Recommendations

• Ergodic properties of a dynamical system arising from percolation theory
• A conditionally sure ergodic theorem with an application to percolation
• Uniqueness and non-uniqueness in percolation theory
• Percolation in Random Cantor Sets
• scientific article; zbMATH DE number 4106426
• Indistinguishability of percolation clusters
• Continuity of percolation probability in ∞ + 1 dimensions
• Percolation theory and some applications

zbMATH Keywords

ergodicityCayley graphspercolationstrong ergodicityindistinguishabilityorbit equivalence relation

Mathematics Subject Classification ID

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

Cited In (9)

• A nonamenable ``factor of a Euclidean space
• Harmonic models and Bernoullicity
• Invariant tilings and unimodular decorations of Cayley graphs
• Heavy Bernoulli-percolation clusters are indistinguishable
• Ergodic theorems for random clusters
• Approximations of standard equivalence relations and Bernoulli percolation at \(p_u\)
• Indistinguishability of collections of trees in the uniform spanning forest
• Universal fluctuations and ergodicity of generalized diffusivity on critical percolation clusters
• Compatible Sequences and a Slow Winkler Percolation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330020)