THE SMALLEST PATH ON COMPLETE GRAPHS

Consider a complete graph with N vertices and N(N 1)/2 edges. We attach an exponential random variable X ij to each edge between vertices P i and P j and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1 p, respectively, then we show that the distribution of the smallest path is close to normal distribution.