Factor-of-iid balanced orientation of non-amenable graphs

DOI10.1016/j.ejc.2023.103784zbMath1525.05073arXiv2106.12530MaRDI QIDQ6057456

Ferenc Bencs, Aranka Hrušková, László Márton Tóth

Publication date: 25 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Bernoulli shiftsBernoulli graphings of quasi-transitive unimodular graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect matchings as IID factors on non-amenable groups
• Bounds on the number of Eulerian orientations
• On percolation critical probabilities and unimodular random graphs
• Invariant Schreier decorations of unimodular random networks
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Invariant random perfect matchings in Cayley graphs
• Processes on unimodular random networks
• Probability on Trees and Networks
• Full Banach Mean Values on Countable groups.
• Ramanujan graphings and correlation decay in local algorithms
• Orienting Borel graphs
• Borel Combinatorics of Locally Finite Graphs
• Factors of IID on Trees
• Factors of independent and identically distributed processes with non-amenable group actions
• Brief Announcement: Classification of Distributed Binary Labeling Problems