Factor of iid's through stochastic domination
Abstract
We develop a method to prove that certain percolation processes on amenable random rooted graphs are factors of iid (fiid), given that the process is a monotone limit of random finite subgraphs that satisfy a certain independent stochastic domination property. Among the consequences are the previously open claims that the Uniform Spanning Forest (USF) is a factor of iid for recurrent graphs, it is a finite-valued finitary fiid on amenable graphs, and that the critical Ising model on d is a finite-valued finitary fiid, using the known uniqueness of the Gibbs measure.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.