BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20221010T173000
DTEND;VALUE=DATE:20221010T173000
UID:11928@agenda.unifr.ch
DESCRIPTION:Elections often take place in districts that divide up a\ncountry or region.  Sometimes these are relatively fixed, like the\ncantons of Switzerland.  What if you could re-draw the districts\nregularly and try to get advantage for one group over another group in\nthe election?  I'll discuss some mathematical ideas to sample\ndistricting plans with a random walk through the space of graph\npartitions.  This leads to beautiful questions about the geometry of\ngraphs and spanning trees.  And it lets you see whether a plan is\nnormal or extreme compared to the alternatives created through a\nneutral process.  I'll tell you how the logic has been received by\nlawyers and judges in the United States.
SUMMARY:Plancherel Lecture: Graphs, partitions, and elections
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 21\, auditorium G120\, Bd de Pérolles 90\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/11928
END:VEVENT
END:VCALENDAR