|Location:||MSRI: Simons Auditorium, Online/Virtual|
To participate in this seminar, please register HERE.
In this talk I'll pitch some open problems that I think could be of interest to members of both the AGRS and COMD programs, and I'll spend a significant share of the time talking about a mathematically beautiful problem that is all over U.S. democracy reform debates at the moment.
Namely: sampling balanced, connected graph partitions—otherwise known as redistricting. I'll focus on Markov chain approaches, explain why classical (Ising-style) statistical physics models hit obstructions, and give some state-of-the-art alternatives. This stuff is in front of the Supreme Court literally right now, with major implications for
partisan and racial fairness in American elections.