Factors of IID on trees
From MaRDI portal
Publication:5366945
DOI10.1017/S096354831600033XzbMATH Open1371.05129arXiv1401.4197OpenAlexW2962776577MaRDI QIDQ5366945FDOQ5366945
Authors: Russell Lyons 
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well. Despite recent spectacular progress of Bowen, the situation for non-amenable groups, including free groups, is still largely mysterious. We present some illustrative results and open questions on free groups, which are particularly interesting in combinatorics, statistical physics, and probability. Our results include bounds on minimum and maximum bisection for random cubic graphs that improve on all past bounds.
Full work available at URL: https://arxiv.org/abs/1401.4197
Recommendations
Gaussian processes (60G15) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Stationary stochastic processes (60G10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamical systems and their relations with probability theory and stochastic processes (37A50)
Cites Work
- Entropy and isomorphism theorems for actions of amenable groups
- Bernoulli shifts with the same entropy are isomorphic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A measure-conjugacy invariant for free group actions
- Factors of Bernoulli shifts are Bernoulli shifts
- Poisson thinning by monotone factors
- A monotone Sinai theorem
- Symmetric Random Walks on Groups
- Poisson thickening
- Title not available (Why is that?)
- Poisson splitting by factors
- Poisson matching
- Gravitational allocation to Poisson points
- Broadcasting on trees and the Ising model.
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Title not available (Why is that?)
- SOME COMPUTATIONS OF 1-COHOMOLOGY GROUPS AND CONSTRUCTION OF NON-ORBIT-EQUIVALENT ACTIONS
- The isoperimetric number of random regular graphs
- Bernoulli actions are weakly contained in any free action
- Ergodic subequivalence relations induced by a Bernoulli action
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
- Automorphism invariant measures on trees
- Geometric properties of Poisson matchings
- Trees and matchings from point processes
- Tree and grid factors for general point processes
- Stationary map coloring
- Coupling surfaces and weak Bernoulli in one and higher dimensions
- An example of a Kolmogorov automorphism that is not a Bernoulli shift
- Factors of independent and identically distributed processes with non-amenable group actions
- On the Edge-Expansion of Graphs
- Limits of local algorithms over sparse random graphs
- \(T,T^{-1}\) transformation is not loosely Bernoulli
- Invariant colorings of random planar maps
- Perfect matchings as IID factors on non-amenable groups
- Translation-equivariant matchings of coin flips on \(\mathbb Z^d\)
- Ramanujan graphings and correlation decay in local algorithms
- Fixed price of groups and percolation
- Independence ratio and random eigenvectors in transitive graphs
- Extremal cuts of sparse random graphs
- Every transformation is bilaterally deterministic
- A partition on a Bernoulli shift which is not weakly Bernoulli
- Finite state bilaterally deterministic strongly mixing processes
- Invariant random perfect matchings in Cayley graphs
- Very weak Bernoulli for amenable groups
- Invariant percolation and measured theory of nonamenable groups
- Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27--31, 2001. Proceedings
Cited In (28)
- Finite-energy infinite clusters without anchored expansion
- Mutual information decay for factors of i.i.d.
- On the minimum bisection of random 3-regular graphs
- Measure concentration and the weak Pinsker property
- On minimum vertex bisection of random \(d\)-regular graphs
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
- Suboptimality of local algorithms for a class of max-cut problems
- Random interlacement is a factor of i.i.d.
- Local approximation of the maximum cut in regular graphs
- Continuity of the Ising phase transition on nonamenable groups
- Factor of iid percolation on trees
- Factor-of-iid balanced orientation of non-amenable graphs
- Invariant tilings and unimodular decorations of Cayley graphs
- A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels
- Entropy inequalities for factors of IID
- Equivariant thinning over a free group
- Factors of independent and identically distributed processes with non-amenable group actions
- Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID
- Finitely dependent processes are finitary
- Unimodular Hausdorff and Minkowski dimensions
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Correlation bounds for distant parts of factor of IID processes
- On the almost eigenvectors of random regular graphs
- A note on internal partitions: the 5-regular case and beyond
- On tree factorizations of Kn
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
- A monotone isomorphism theorem
- Ising model on trees and factors of IID
This page was built for publication: Factors of IID on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366945)
