Abstract: We study the random simple connected cubic planar graph with an even number n of vertices. We show that the Brownian map arises as Gromov-Hausdorff-Prokhorov scaling limit as n tends to infinity, after rescaling distances by gamma n^{-1/4} for a specific constant gamma>0.
Scaling limit of random cubic planar graphs
10.05.2022 15:15 - 16:15
Organiser:
M. Drmota
Location: