Intelligibility and first passage times in complex urban networks

DOI10.1098/RSPA.2007.0329MaRDI QIDQ3531347zbMATHOpenAlexWikidataFDO

Authors Dimitri Yu. Volchenkov, Ph. Blanchard

Publication date 23 October 2008

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.0996

zbMATH Keywords

first passage timesrandom walksspace syntaxrecurrence times

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Stochastic network models in operations research (90B15)

Abstract: Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node scales apparently linearly in all urban patterns we have studied In space syntax theory, a positive relation between the local property of a node (qualified by connectivity or by the recurrence time) and the global property of the node (estimated in our approach by the first passage time to it) is known as intelligibility. Our approach based on random walks allows to extend the notion of intelligibility onto the entire domain of complex networks and graph theory.

Recommendations

• Markov chain methods for analyzing urban networks
• A network approach to link visibility and urban activity location
• Mathematical analysis of urban spatial networks
• Random planar graphs and the London street network
• Accessibility in complex networks

Cites work

• Centrality in networks of urban streets

Cited in

(4)

• Accessibility in complex networks
• A network approach to link visibility and urban activity location
• A chronotopic model of mobility in urban spaces
• Markov chain methods for analyzing urban networks

This page was built for publication: Intelligibility and first passage times in complex urban networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3531347)