Fetching the paper…
Reading the bibliography…
We give an example of an $\mathsf{FIID}$ vertex-labeling of $\mathbb{T}_3$ whose marginals are uniform on $[0,1]$, and if we delete the edges between those vertices whose labels are different, then some of the remaining clusters are infinite.
B. Bollobás. The Independence Ratio of Regular Graphs Proceedings of the American Mathematical Society
1981
Earlier work this paper cites.
I. Benjamini, R. Lyons, Y. Peres and O. Schramm. Group-invariant Percolation on Graphs Geometric and Functional Analysis
1999
Earlier work this paper cites.
R. Lyons and O. Schramm. Indistinguishability of percolation clusters. Annals of Probability
1999
Earlier work this paper cites.
D. Gaboriau and R. Lyons. (2009) A measurable-group-theoretic solution to Von Neumann’s Problem. Inventiones Mathematicae
2009
Earlier work this paper cites.
I. Chifan and A. Ioana. Ergodic subequivalence relations induced by a Bernoulli action. Geometric and Functional Analysis
2010
Cited alongside, same era.
D. Gaboriau. Orbit equivalence and measured group theory. Proceedings of the ICM (Hyderabad, India, 2010)
2010
Cited alongside, same era.
Á. Backhausz, B. Szegedy, B. Virág. Ramanujan graphings and correlation decay in local algorithms Random Structures and Algorithms
2015
Cited alongside, same era.
G. Pete. Probability and Geometry on Groups
Cited in the paper.
R. Lyons and Y. Peres. Probability on trees and networks
2016
Closest in time.
R. Lyons. Factors of IID on Trees Combinatorics, Probability and Computing
2017
Closest in time.
M. Rahman and B. Virág. Local algorithms for independent sets are half-optimal Annals of Probability
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…