ACO The ACO Seminar (2022–2023)

February 2, 3:30pm, Wean 8220
Riley Thornton, Carnegie Mellon University
Component finite subgraphs of regular trees


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.

Back to the ACO home page Back to the ACO Seminar schedule