Feb 8, 4:30pm, Wean 7500

Gabor Lippner, Harvard

Measurable graphs and random perfect matchings

Gabor Lippner, Harvard

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.