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 distribu...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!