University of Cambridge > Talks.cam > Probability > On the enumeration of random maps with three tight boundaries and its probabilistic consequences

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

On the enumeration of random maps with three tight boundaries and its probabilistic consequences

Download to your calendar using vCal

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

We consider the enumeration problem of graphs on surfaces, or maps, with three boundaries, also colloquially called pairs of pants. Perhaps surprisingly, a formula due to Eynard and extended by Collet-Fusy shows that this problem has a very simple and explicit solution, which becomes even simpler when one asks that the boundaries are tight, meaning that they have smallest possible length in their free homotopy class. We provide a bijective approach to this formula which consists in decomposing the graph into elementary pieces in a way that is reminiscent of certain geometric constructions of pairs of pants in hyperbolic geometry. I will also discuss the probabilistic consequences of this bijective approach by studying statistics of minimal separating loops in random maps with boundaries. (Based on joint work with J\’er\’emie Bouttier and Emmanuel Guitter.)

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

to be confirmed CMS, MR to be confirmed Bateman Auditorium, Gonville & Caius College, Cambridge, CB2 1TA

Other talks

Title to be confirmed Dinner Title and abstract tba "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. Kirk Public Lecture: Title TBC The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues
 

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