Abstract:
Factor of iid processes have been widely studied in connection with distributed computing, descriptive set theory, and random regular graphs (among many other topics). In this talk I will gesture at some of these connections and measure how different the combinatorics of factor of iid processes and finite combinatorics can be for acyclic graphs.