Abstract
The structure of road networks has been investigated in accordance with the development of GIScience. By classifying road networks into wide and narrow ones, we can define the route as the path from the route’s origin (also called the root) on a wide road network to a narrow road segment which consists of the sequence of narrow road segments arranged by ascending order of the number of steps of adjacency to its root. The length of the route can be defined with the following geometric and topological terms: the route distance, measuring the length along the route and the depth, counting the number of road segments on the route. The depth plays the important role of being a substitute for the route distance in modelling road networks as a planar graph. Since road networks clearly exhibit irregular patterns and road segment lengths are non-uniform, it is considered appropriate to adopt a stochastic approach rather than a deterministic one to analyse the route distance. However, the relationship between the route distance and its depth has not been sufficiently investigated stochastically. Therefore, the research question is how can we estimate the route distance from its depth? Based on an empirical study in the Tokyo metropolitan region, it was found that (1) the statistical distribution of the route distance can be formulated as an Erlang distribution whose parameters are its depth and the inverse of the mean length of narrow road segments, and (2) this length is constant and close to 40 m. Therefore, we can estimate the route distance from only one parameter, the depth. Also, as a practical application, accessibility to the kth depth link in terms of firefighting was evaluated because the maximum length of the extension of fire hoses is approximately 200 m. It was found that (1) even if k ≤ 5, the probability that the route distance to the kth depth link is equal to or longer than 200 m ranges from 0 to 0.45; and (2) if k ≥ 8, the probability is approximately 1. These indicate the limitation of the deterministic approach because, on the basis of complete grid patterns (with intervals of 40 m between intersections), k = 5 corresponds to a distance of 200 m from wide road networks and the route to the 5th depth link can be covered with fire hoses. Moreover, it was found that the connectivity of wide road networks is higher than that of narrow ones in terms of the smaller ratio of cul-de-sacs and the larger ratio of four-way intersections. These answers contribute substantially not only to constructing a science of cities that provides a simple model and specifies the most important parameter, but also to our understanding of the structure of narrow road networks within several hundred metres of wide road networks.
Similar content being viewed by others
References
Aldous DJ, Shun J (2010) Connected spatial networks over random points and a route-length statistic. Stat Sci 25(3):275–288
Barthèlemy M (2011) Spatial networks. Phys Rep 499(1):1–101
Barthèlemy M (2016) The structure and dynamics of cities: urban data analysis and theoretical modelling. Cambridge University Press, Cambridge
Barthèlemy M (2018) Morphogenesis of spatial networks. Springer, Cham
Batty M (2013) The new science of cities. Cambridge University Press, Cambridge
Black WR, Thomas I (1998) Accidents on Belgium’s motorways: a network autocorrelation analysis. J Transp Geogr 6(1):21–31
Cardillo A, Scellato S, Latora V, Porta S (2006) Structural properties of planar graphs of urban street patterns. Phys Rev E 73(6):066107
Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269–271
Ellard C (2009) You are here. Doubleday, New York
Ferenc JS, Néda Z (2007) On the size distribution of Poisson Voronoi cells. Phys A 385:518–526
Gastner MT, Newman MEJ (2006) The spatial structure of networks. Eur Phys J B 49:247–252
Gonçalves DNS et al (2014) Analysis of the difference between the Euclidean distance and the actual road distance in Brazil. Transp Res Proc 3:876–885
Goodchild M (1986) Spatial autocorrelation. CATMOG No. 47. Geo Books, Norwich
Griffith DA (2007) Spatial structure and spatial interaction: 25 years later. Rev Reg Stud 37:28–38
Imaizumi K, Asami Y (2000) A study on estimation of street-blockades caused by a great earthquake: to improve densely inhabited urban area for disaster prevention. J Arch Plan (Trans AIJ) 65(529):225–231
Jansen-Osmann P, Wiedenbauer G (2004) The influence of turns on distance cognition: new experimental approaches to clarify the route-angularity effect. Environ Behav 36(6):790–813
Jiang B (2007) A topological pattern of urban street networks: universality and peculiarity. Phys A 384:647–655
Jiang B, Claramunt C (2004) Topological analysis of urban street networks. Environ Plan 31(1):151–162
Jiang B, Liu X (2011) Computing the fewest-turn map directions based on the connectivity of natural roads. Int J Geogr Inf Sci 25(7):1069–1082
Jiang B, Okabe A (2014) Different ways of thinking about street networks and spatial analysis. Geogr Anal 46:341–344
Jiang B, Zhao S, Yin J (2008) Self-organized natural roads for predicting traffic flow: a sensitivity study. J Stat Mech Theory Exp 07:P07008
Kiang T (1966) Random fragmentation in two and three dimensions. Z Astrophys 64:433–439
Koshizuka T, Kobayashi J (1983) On the relation between road distance and Euclidean distance. City Plan Rev 18:43–48
Love RF et al (1988) Facility location: models and methods. North-Holland Publishing Company, Amsterdam
Marshall S (2005) Streets and patterns: the structure of urban geometry. Routledge, London
Okabe A, Sugihara K (2012) Spatial analysis along networks: statistical and computational methods. Wiley, Hoboken
Okabe A, Yomono H (1988) Statistical methods for evaluating the geometrical hierarchy of a network. Geogr Anal 20(2):122–139
Peeters D, Thomas I (2009) Network autocorrelation. Geogr Anal 41(4):434–443
Peponis J, Bafna S, Zhang Z (2008) The connectivity of streets: reach and directional distance. Environ Plan 35(5):881–901
Pineda E et al (2004) Cell size distribution in random tessellation of space. Phys Rev E 70:66–119
Porta S, Crucitti P, Latora V (2006) The network analysis of urban streets: a primal approach. Environ Plan 3(5):705–725
Sadalla EK, Staplin LJ (1980) The perception of traversed distance: intersections. Environ Behav 12(2):167–182
Strano E, Nicosia V, Latara V, Porta S, Barthèlemy M (2012) Elementary processes governing the evolution of road networks. Sci Rep 2
Usui H, Asami Y (2011) An evaluation of road network patterns based on the criteria for fire-fighting. Cybergeo Eur J Geogr Syst Modell Geostat. Art 542
Yamada I, Thill JC (2010) Local indicators of network-constrained clusters in spatial patterns represented by a link attribute. Ann Assoc Am Geogr 100(2):269–285
Zeng W, Church RL (2009) Finding shortest paths on real road networks: the case for A*. Int J Geogr Inf Sci 23(4):531–543
Acknowledgements
The author is grateful to Professor Yasushi Asami, two anonymous referees, Professor Toshihiro Osaragi and Professor Michinori Hatakeyama for their extremely valuable comments and suggestions. This work was supported by JSPS KAKENHI Grant Numbers JP17K12978 and JP16H01830.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1. Statistical distribution of the lengths of jth depth links in the Tokyo metropolitan region
Appendix 2. Derivation of Eq. (11)
To estimate the route distance from k, we focus on the fact that the gamma distribution has a reproductive property. This property states that if the stochastic variable, d(lj, 3 or 4), follows the identical gamma distribution, then the summation of d(lj, 3 or 4), denoted by d(r(k)), also follows a gamma distribution. We confirm this by using a generating function:
In general, the generating function of the following generalized gamma distribution,
is derived as:
By substituting Eq. (9) for Eq. (15) and x = d(lj, 3 or 4), the generating function of d(lj, 3 or 4) is derived:
By setting ν = 2 in Eq. (17), Eq. (18) is also derived. From Eqs. (5) and (9), the generating function of d(r(k)) is written as:
where x = (x0 = d(l0, 3 or 4), …, xj = d(lj, 3 or 4), …, xk−1 = d(lk−1, 3 or 4)) and h(x) is the joint probability density function of x. As mentioned previously, for any i \( \ne \) j, there is no correlation between d(li, 3 or 4) and d(lj, 3 or 4). Thus, we assume that for any i \( \ne \) j, d(li, 3 or 4) and d(lj, 3 or 4) are independent from each other, and the generating function of the theoretical relative frequency distribution of d(r(k)) is derived as follows:
Compared with Eq. (17), by setting ν = 2 k in Eq. (17), Eq. (20) is derived. Hence, the theoretical relative frequency distributions of d(r(k)) are formulated as the following gamma distributions given by Eq. (11).
Rights and permissions
About this article
Cite this article
Usui, H. Estimation of geometric route distance from its topological distance: application to narrow road networks in Tokyo. J Geogr Syst 20, 387–412 (2018). https://doi.org/10.1007/s10109-018-0276-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10109-018-0276-3