Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics

Abstract

Different models of random walks on the dual graphs of compact urban structures are considered. Analysis of access times between streets helps to detect the city modularity. The statistical mechanics approach to the ensembles of lazy random walkers is developed. The complexity of city modularity can be measured by an information-like parameter which plays the role of an individual fingerprint of {\it Genius loci}. Global structural properties of a city can be characterized by the thermodynamical parameters calculated in the random walks problem.

44 pages, 22 figures, 2 tables

References in corpus (1)

• Networks and Cities: An Information Perspective

Cited by in corpus (8)

• A Topological Pattern of Urban Street Networks: Universality and Peculiarity
• Intelligibility and First Passage Times In Complex Urban Networks
• Exact eigenvalue spectrum of a class of fractal scale-free networks
• Markov Chain Methods For Analyzing Complex Transport Networks
• The Network of Commuters in London
• Modelling Complex Networks: Cameo Graphs And Transport Processes
• Urban Landscape is an Important Factor in Rising Inequality, Spatial Segregation, and Social Isolation
• Random Walks Estimate Land Value