Perfect matchings as IID factors on non-amenable groups
From MaRDI portal
(Redirected from Publication:648969)
Abstract: We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs.
Recommendations
Cites work
- Amenable actions and almost invariant sets
- Borel chromatic numbers
- Borel oracles. An analytical approach to constant-time algorithms
- Closed Sets Without Measurable Matching
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- Factors of independent and identically distributed processes with non-amenable group actions
- Group-invariant percolation on graphs
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- Induced Forests in Regular Graphs with Large Girth
- Invariant colorings of random planar maps
- Large independent sets in regular graphs of large girth
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Non-abelian free group actions: Markov processes, the Abramov-Rohlin formula and Yuzvinskii's formula
- On groups with full Banach mean value
- On the independence and chromatic numbers of random regular graphs
- On the Shannon capacity of a graph
- Poisson matching
- Poisson trees, succession lines and coalescing random walks
- Rigidity theorems for actions of product groups and countable Borel equivalence relations
- Sets with doubleton sections, good sets and ergodic theory
- Stationary map coloring
- Symmetric Random Walks on Groups
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Tree and grid factors for general point processes
- Trees and matchings from point processes
- TWO THEOREMS IN GRAPH THEORY
Cited in
(41)- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Følner tilings for actions of amenable groups
- Entropy and expansion
- A nonamenable ``factor of a Euclidean space
- Ising model on trees and factors of IID
- Markovian properties of continuous group actions: algebraic actions, entropy and the homoclinic group
- Measurable equidecompositions for group actions with an expansion property
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Invariant random perfect matchings in Cayley graphs
- Controllability, matching ratio and graph convergence
- Suboptimality of local algorithms for a class of max-cut problems
- On the almost eigenvectors of random regular graphs
- Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022
- A determinacy approach to Borel combinatorics
- Kőnig's line coloring and Vizing's theorems for graphings
- Ramanujan graphings and correlation decay in local algorithms
- Correlation bounds for distant parts of factor of IID processes
- Equivalence relations that act on bundles of hyperbolic spaces
- Ultraproducts of measure preserving actions and graph combinatorics
- Weak containment of measure-preserving group actions
- On Baire measurable colorings of group actions
- Orienting Borel graphs
- MEASURABLE REALIZATIONS OF ABSTRACT SYSTEMS OF CONGRUENCES
- A spectral strong approximation theorem for measure-preserving actions
- Factor of iid percolation on trees
- Factors of IID on trees
- An antibasis result for graphs of infinite Borel chromatic number
- Measurable perfect matchings for acyclic locally countable Borel graphs
- BROOKS’ THEOREM FOR MEASURABLE COLORINGS
- Factor-of-iid balanced orientation of non-amenable graphs
- Continuity of the Ising phase transition on nonamenable groups
- A Markovian and Roe-algebraic approach to asymptotic expansion in measure
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
- Measurable graph combinatorics
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
- Title not available (Why is no real title available?)
- Sparse reconstruction in spin systems. II: Ising and other factor of IID measures
- Finitary codings for spatial mixing Markov random fields
- Independence ratio and random eigenvectors in transitive graphs
- Baire measurable paradoxical decompositions via matchings
This page was built for publication: Perfect matchings as IID factors on non-amenable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648969)
