Abstract
Let $M_{n}$ be a simple triangulation of the sphere $\mathbb{S}^{2}$, drawn uniformly at random from all such triangulations with $n$ vertices. Endow $M_{n}$ with the uniform probability measure on its vertices. After rescaling graph distance by $(3/(4n))^{1/4}$, the resulting random measured metric space converges in distribution, in the Gromov–Hausdorff–Prokhorov sense, to the Brownian map. In proving the preceding fact, we introduce a labelling function for the vertices of $M_{n}$. Under this labelling, distances to a distinguished point are essentially given by vertex labels, with an error given by the winding number of an associated closed loop in the map. We establish similar results for simple quadrangulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.