Intelligibility and first passage times in complex urban networks

Blanchard P, Volchenkov D (2008)
Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences 464(2096): 2153-2167.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Abstract / Bemerkung
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 us to extend the notion of intelligibility onto the entire domain of complex networks and graph theory.
Stichworte
recurrence times; first passage times; space syntax; random walks
Erscheinungsjahr
2008
Zeitschriftentitel
Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences
Band
464
Ausgabe
2096
Seite(n)
2153-2167
ISSN
1364-5021
eISSN
1471-2946
Page URI
https://pub.uni-bielefeld.de/record/1587324

Zitieren

Blanchard P, Volchenkov D. Intelligibility and first passage times in complex urban networks. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences. 2008;464(2096):2153-2167.
Blanchard, P., & Volchenkov, D. (2008). Intelligibility and first passage times in complex urban networks. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences, 464(2096), 2153-2167. https://doi.org/10.1098/rspa.2007.0329
Blanchard, Philippe, and Volchenkov, Dimitry. 2008. “Intelligibility and first passage times in complex urban networks”. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences 464 (2096): 2153-2167.
Blanchard, P., and Volchenkov, D. (2008). Intelligibility and first passage times in complex urban networks. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences 464, 2153-2167.
Blanchard, P., & Volchenkov, D., 2008. Intelligibility and first passage times in complex urban networks. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences, 464(2096), p 2153-2167.
P. Blanchard and D. Volchenkov, “Intelligibility and first passage times in complex urban networks”, Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences, vol. 464, 2008, pp. 2153-2167.
Blanchard, P., Volchenkov, D.: Intelligibility and first passage times in complex urban networks. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences. 464, 2153-2167 (2008).
Blanchard, Philippe, and Volchenkov, Dimitry. “Intelligibility and first passage times in complex urban networks”. Proceedings of the Royal Society A-Mathematical Physical and Engineering Sciences 464.2096 (2008): 2153-2167.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Quellen

arXiv: 0710.0996

Suchen in

Google Scholar