Statistical Methods for Evaluating the Geometrical Hierarchy of a Network

Abstract

The objective of this paper is to present statistical methods for evaluating the geometrical hierarchy of a network in comparison with a random hierarchy network. First, the random hierarchy network is explicitly formulated by four stochastic processes in which line segments or lines, which represent roads, are randomly placed and their placement is independent of their ranks. Second, under these stochastic processes, this paper derives the expected value and variance of i) the number of intersections between roads of different ranks; and ii) the distance from an arbitrary point to the nearest highest‐ranked road through two kinds of routes. Using these expected values, the intersection index and the detour index are proposed, and it is shown that these indicators are useful for evaluating the geometrical hierarchy of a network. As calculation of these indices is laborious, an efficient computational method is developed, and its application to an actual example is described.