Consider the complete graph on n nodes with iid exponential weights of unit mean on the edges. A number of properties of this model have been investigated including first passage percolation, diameter, minimum spanning tree, etc. In particular, Janson showed that the typical distance between two nodes scales as (log n)/n, whereas the diameter (maximum distance between any two nodes) scales as 3(log n)/n. Bollobas et al. showed that, for any fixed k, the weight of the Steiner tree connecting k typical nodes scales as (k-1)log n/n, which recovers Janson's result for k=2. We extend this result to show that the worst case k-Steiner tree, over all choices of k nodes, has weight scaling as (2k-1)log n/n. Further, Janson derived the limiting distribution of the typical distance between two nodes. We refine the result of Bollobas et al. and present a perhaps surprising result in this direction for the typical Steiner tree which has implications for the limiting shape of the 3-Steiner tree. This is joint work with Angus Davidson and Balint Toth.
A J Ganesh, Deptt of Mathematics, Univ of Bristol and Adjunct Faculty EE Dept., IIT Bombay