都市における汎用的ネットワークとそのミニマムスパンニングツリーの長さの推定

抄録

The network connectivity among inter cities as well as inner cities is getting highly complicated. From this point of view, we shall need to analyse an energy flow or information flom through the graphs. We shall present a typical proble which can be applied to a general case. So that, how long is the minimum spanning tree on the n-points scattered on a square 1×1? Our aim is to present the answer that an expected value of this length is almost surely at least 0.564√n by using random graph theory.