Geometry of the minimal spanning tree of a random 3-regular graph (Q2041649)

This paper studies the scaling limit of the minimal spanning tree of random 3-regular graphs. Let \(G(n,3)\) be the random 3-regular graph and \(\bar{G}(n,3)\) be the random multi-graph with all nodes having degree 3 via a configuration model. For even \(n\), let \(M_n\) be the minimal spanning tree of \(G(n,3)\), which is viewed as a metric space using the tree distance. It is shown \(n^{-1/3}M_n\) converges to \(6^{1/3}\mu\) in distribution as \(n\) goes to infinity with respect to the Gromov-Hausdorff-Prokhorov topology, where \(\mu\) is a random compact metric measure space determined in the scaling limit of minimal spanning tree of complete graph. For even \(n\), let \(\bar{M}_n\) be the minimal spanning tree of \(\bar{G}(n,3)\), which is viewed as a metric space using the tree distance. It is also shown that \(n^{-1/3}\bar{M}_n\) converges to \(6^{1/3}\mu\) in distribution as \(n\) goes to infinity with respect to the Gromov-Hausdorff-Prokhorov topology.