The scaling limit of the minimum spanning tree of the complete graph
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 a...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Institute of Mathematical Statistics
2017
|