Loop statistics for dimer models on the torus

Add to your list(s) Download to your calendar using vCal

• Cedric Boutillier (Paris)
• Tuesday 06 March 2012, 14:15-15:15
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact grg1000.

A dimer configuration of a graph G is a subset of edges such that every vertex of G is adjacent to exactly one edge of this subset. If we superimpose two dimer configurations of the same graph, we get double edges and loops. When G is a large piece of a periodic graph drawn on the torus, these loops can wind around the torus non trivially. We derive the limiting law, when the size of the mesh of G goes to zero, of the winding number of this family of loop when the two configurations are sampled at random from a Gibbs measure.

This talk is part of the Probability series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.