University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Nesting statistics in the O(n) loop model on random lattices

Nesting statistics in the O(n) loop model on random lattices

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

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

Random Geometry

Co-author: Jeremie Bouttier (CEA Saclay and ENS Paris)

We investigate how deeply nested are the loops in the O(n) model on random maps. In particular, we find that the number P of loops separating two points in a planar map in the dense phase with V >> 1 vertices is typically of order c(n) ln V for a universal constant c(n), and we compute the large deviations of P. The formula we obtain shows similarity to the CLE _{kappa} nesting properties for n = 2spi(1 - 4/kappa). The results can be extended to all topologies using the methods of topological recursion.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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