University of Cambridge > Talks.cam > Probability > Loop statistics for dimer models on the torus

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Loop statistics for dimer models on the torus

Download to your calendar using vCal

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

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:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom Causal Inference Reading Group Average on weekdays: 9134.31593794 kWh

Other talks

Together Now: Cooperation and Collaboration in Social Art Practice Group Work Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Shining a light on the origin of supermassive black holes with cosmological simulations Kirk Public Lecture: Title TBC Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity