Oct 11 2019

Departmental Colloquium: Redistricting and a tale of two Markov chains, by Moon Duchin

October 11, 2019

3:00 PM - 3:50 PM


636 SEO


Chicago, IL

Moon Duchin (Tufts): Redistricting and a tale of two Markov chains

Random walks are a fundamental area of study in pure math, and they undergird the technique called Markov chain Monte Carlo (MCMC) that drives a huge range of statistical applications in science, engineering, and industry. I'll explain how MCMC found its way into the redistricting conversation, and I'll introduce a new Markov chain called "Recombination"—a graph partition chain designed for redistricting—and contrast that with the standard "Flip" chain. Along the way, I hope to explain some tradeoffs and debates in the use of math models in politics, policy, and law.

There will be a Q&A session aimed at graduate students from 4:30 to 5:30 in 636 SEO.

Please click here to make changes to, or delete, this seminar announcement.


Julius Ross

Date posted

Oct 22, 2019

Date updated

Oct 22, 2019


Moon Duchin | (Tufts)