The diameter of the minimum spanning tree of the complete graph with inhomogeneous random weights

Othmane Safsafi

We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is giv…