Measuring the network robustness by Monte Carlo estimation of shortest path length distribution

Two kinds of robustness measure for networks are introduced and applied to the road network systems in Japan. One is on the connectivity of randomly chosen pair of vertices, another is on the shortest path length between pair of connected vertices. We devise Monte Carlo methods for the computation of two measures.