3 citations · 3 across the 1 of their papers we have counts for
1 paper
Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt +1
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 renormal…