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-connected cubic planar graph is the dual of a simple triangulation, for which it is known that the scaling limit is the Brownian sphere. Curien and Le Gall have recently developed a framework to study the modification of distances in general triangulations and in their dual. By extending this framework to simple triangulations, it is shown that 3-connected cubic planar graphs with modified distances converge jointly with their dual triangulation to the Brownian sphere.
M.A.’s research was supported by the ANR grant GATO (ANR-16-CE40-0009-01) and the ANR grant IsOMa (ANR-21-CE48-0007). E.F. acknowledges the support of the ANR grant GATO (ANR-16-CE40-0009-01) and the ANR grant Combine (ANR-19-CE48-0011).
We are grateful to an anonymous referee, whose careful reading significantly improved the presentation of this paper.
"Random cubic planar graphs converge to the Brownian sphere." Electron. J. Probab. 28 1 - 54, 2023. https://doi.org/10.1214/23-EJP912