The scaling limit of the minimum spanning tree of the complete graph

Abstract : Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its vertices. We show that the resulting space converges in distribution, as n tends to infinity, to a random measured metric space in the Gromov-Hausdorff-Prokhorov topology. We additionally show that the limit is a random binary R-tree and has Minkowski dimension 3 almost surely. In particular, its law is mutually singular with that of the Brownian continuum random tree or any rescaled version thereof. Our approach relies on a coupling between the MST problem and the Erdös-Rényi random graph. We exploit the explicit description of the scaling limit of the Erdös-Rényi random graph in the so-called critical window, established by the first three authors in an earlier paper, and provide a similar description of the scaling limit for a "critical minimum spanning forest" contained within the MST.
Complete list of metadatas

https://hal.inria.fr/hal-00773360
Contributor : Nicolas Broutin <>
Submitted on : Sunday, January 13, 2013 - 3:59:04 PM
Last modification on : Monday, February 11, 2019 - 4:40:02 PM

Links full text

Identifiers

  • HAL Id : hal-00773360, version 1
  • ARXIV : 1301.1664

Collections

Citation

Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt, Grégory Miermont. The scaling limit of the minimum spanning tree of the complete graph. Annals of Probability, Institute of Mathematical Statistics, 2017, 45, pp.3075--3144. ⟨hal-00773360⟩

Share

Metrics

Record views

342