|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Matchings on large diluted graphs : The cavity method at positive temperature.
If you have a question about this talk, please contact Elena Yudovina.
This talk pertains to rigorous derivations of the cavity method on large graphs. The focus of the present talk will be on the maximal matching problem but other combinatorial optimization problems will be mentioned.
We will obtain a limit theorem for the asymptotic size of a maximum matching of a graph sequence. When the graphs are random and converge in distribution to a unimodular Galton-Watson tree, the limiting quantity turns out to satisfy a recursive distributional equation, which we solve. This leads to an explicit formula that extends the well-known result by Karp and Sipser for Erdos-Renyi random graphs.
This is based on a joint work with Marc Lelarge and Justin Salez available at http://arxiv.org/abs/1102.0712
This talk is part of the Optimization and Incentives Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsQuantitative cell biology symposium: June 18 2009 The Garden of Eden / Kharsag as the Origin of Agriculture in Rashaya El-Wadi, Lebanon Institute of Theoretical Geophysics Informal Lunchtime Seminars (DAMTP)
Other talksStrain And Thermal Expansion Coefficient Of Graphene Studied By Raman Spectroscopy A Heisenberg Miscellany New roles for RIG-I family proteins in innate immunity Annual Conversazione Putting life into numbers – how statistical science has transformed health care TBA