Markov chain methods for analyzing urban networks

Volchenkov D, Blanchard P (2008)
Journal of Statistical Physics 132(6): 1051-1069.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Abstract / Bemerkung
Complex transport networks abstracted as graphs (undirected, directed, or multi-component) can be effectively analyzed by random walks (or diffusions). We have unified many concepts into one framework and studied in details the structural and spectral properties of spatial graphs for five compact urban patterns.
Stichworte
traffic equilibrium; complex networks; random walks
Erscheinungsjahr
2008
Zeitschriftentitel
Journal of Statistical Physics
Band
132
Ausgabe
6
Seite(n)
1051-1069
ISSN
0022-4715
eISSN
1572-9613
Page URI
https://pub.uni-bielefeld.de/record/1586584

Zitieren

Volchenkov D, Blanchard P. Markov chain methods for analyzing urban networks. Journal of Statistical Physics. 2008;132(6):1051-1069.
Volchenkov, D., & Blanchard, P. (2008). Markov chain methods for analyzing urban networks. Journal of Statistical Physics, 132(6), 1051-1069. doi:10.1007/s10955-008-9591-2
Volchenkov, D., and Blanchard, P. (2008). Markov chain methods for analyzing urban networks. Journal of Statistical Physics 132, 1051-1069.
Volchenkov, D., & Blanchard, P., 2008. Markov chain methods for analyzing urban networks. Journal of Statistical Physics, 132(6), p 1051-1069.
D. Volchenkov and P. Blanchard, “Markov chain methods for analyzing urban networks”, Journal of Statistical Physics, vol. 132, 2008, pp. 1051-1069.
Volchenkov, D., Blanchard, P.: Markov chain methods for analyzing urban networks. Journal of Statistical Physics. 132, 1051-1069 (2008).
Volchenkov, Dimitry, and Blanchard, Philippe. “Markov chain methods for analyzing urban networks”. Journal of Statistical Physics 132.6 (2008): 1051-1069.