Trees against gerrymandering
Moon Duchin, Professor of Computer Science and Data Science, University of Chicago
Abstract: Motivated by the study of political redistricting, many mathematicians have gotten interested in sampling algorithms for graph partitions. (In this case the graph is a contact network of geographic units in a state.) There has been quite a lot of recent progress developing spanning-tree methods to do the sampling, and I'll survey some of what is and is not known. Bonus: I'll show you how this is being used in the current redistricting court cases in Texas!
Cost: free
Kisa Kowal
(847) 491-3974
Email