We discuss how random walks can be used to analyze
random graphs. We tie down the expected diameter of the random minimum
weight spanning tree of a complete graph with i.i.d weights. This
is joint work with Broutin and Reed. It answers a question of
Frieze and McDiarmid.