Factors of IID on Trees
From MaRDI portal
Publication:5366945
DOI10.1017/S096354831600033XzbMath1371.05129arXiv1401.4197OpenAlexW2962776577MaRDI QIDQ5366945
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4197
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)
Related Items
Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID, Factor of IID Percolation on Trees, Factor-of-iid balanced orientation of non-amenable graphs, A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels, Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree, Continuity of the Ising phase transition on nonamenable groups, Suboptimality of local algorithms for a class of max-cut problems, On the almost eigenvectors of random regular graphs, On the minimum bisection of random 3-regular graphs, A note on internal partitions: the 5-regular case and beyond, Uniform even subgraphs and graphical representations of Ising as factors of i.i.d., Random interlacement is a factor of i.i.d., Correlation Bounds for Distant Parts of Factor of IID Processes, Spectral measures of factor of i.i.d. processes on vertex-transitive graphs, Finite-energy infinite clusters without anchored expansion, A monotone isomorphism theorem, Local approximation of the maximum cut in regular graphs, Equivariant thinning over a free group, Ising model on trees and factors of IID, Entropy inequalities for factors of IID, Invariant tilings and unimodular decorations of Cayley graphs, Unimodular Hausdorff and Minkowski dimensions, Finitely dependent processes are finitary
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotone Sinai theorem
- Poisson thickening
- Stationary map coloring
- \(T,T^{-1}\) transformation is not loosely Bernoulli
- Perfect matchings as IID factors on non-amenable groups
- Poisson splitting by factors
- Geometric properties of Poisson matchings
- Poisson matching
- Independence ratio and random eigenvectors in transitive graphs
- A measure-conjugacy invariant for free group actions
- Ergodic subequivalence relations induced by a Bernoulli action
- Gravitational allocation to Poisson points
- Entropy and isomorphism theorems for actions of amenable groups
- The isoperimetric number of random regular graphs
- Automorphism invariant measures on trees
- Every transformation is bilaterally deterministic
- Coupling surfaces and weak Bernoulli in one and higher dimensions
- Trees and matchings from point processes
- Tree and grid factors for general point processes
- Very weak Bernoulli for amenable groups
- Finite state bilaterally deterministic strongly mixing processes
- Broadcasting on trees and the Ising model.
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Invariant random perfect matchings in Cayley graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- Extremal cuts of sparse random graphs
- Poisson thinning by monotone factors
- Bernoulli shifts with the same entropy are isomorphic
- Factors of Bernoulli shifts are Bernoulli shifts
- An example of a Kolmogorov automorphism that is not a Bernoulli shift
- Invariant colorings of random planar maps
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Symmetric Random Walks on Groups
- Ramanujan graphings and correlation decay in local algorithms
- Translation-Equivariant Matchings of Coin Flips on ℤd
- On the Edge-Expansion of Graphs
- Fixed price of groups and percolation
- Invariant percolation and measured theory of nonamenable groups
- Bernoulli actions are weakly contained in any free action
- Factors of independent and identically distributed processes with non-amenable group actions
- SOME COMPUTATIONS OF 1-COHOMOLOGY GROUPS AND CONSTRUCTION OF NON-ORBIT-EQUIVALENT ACTIONS
- A partition on a Bernoulli shift which is not weakly Bernoulli
- Limits of local algorithms over sparse random graphs
- Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27--31, 2001. Proceedings
