Statistical matching theory

Series: 
Combinatorics Seminar
Thursday, January 22, 2015 - 12:05
1 hour (actually 50 minutes)
Location: 
Skiles 005
,  
MIT
,  
Organizer: 
 In this talk we will survey some recent development on statistical properties of matchings of very large and infinite graphs. The main goal of the talk is to describe a few applications of a new concept called matching measure. These applications include new results on the number of (perfect) matchings in large girth graphs as well as simple new proofs of certain statistical physical theorems. In particular, we will sketch the proof of Friedland's Lower Matching Conjecture, and a new proof of Schrijver's and Gurvits's theorems. This talk is based on joint papers with various subsets of Miklos Abert, Peter E. Frenkel, Tamas Hubai and Gabor Kun.