A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic planar graphs into their 3-connected components, the metric structure of a random cubic planar graph is shown to be well approximated by its unique 3-connected component of linear size, with modified distances. Then, Whitney's theorem ensures that a 3-connectedarXiv:2203.17245v2 fatcat:qu46kxkljjaytg5hayrof2nhda