CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Math Colloquium
Gabor Lippner
Title: Measurable graphs and random perfect matchings

Abstract: Measurable graphs have received substantial interest recently as limit objects for bounded degree graph sequences. In this talk I will explain how classical questions from finite graph theory can be extended to the measurable context. As an application I will outline a connection between measurable graphs and certain random processes, called factor of iid-s. This can be used to translate a measurable version of Tutte's theorem into a construction of random perfect matchings in Cayley graphs. Joint work with Endre Csoka.

Date: Friday, February 8, 2013
Time: 4:30 pm
Location: Wean Hall 7500
Submitted by:  Bohman
Note: Refreshments at 4:00 pm, Wean Hall 6220