Markov chain methods for analyzing urban networks
Volchenkov D, Blanchard P (2008)
Journal of Statistical Physics 132(6): 1051-1069.
Download
No fulltext has been uploaded. References only!
Journal Article
| Original Article
| Published
| English
No fulltext has been uploaded
Department
Abstract
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.
Keywords
Publishing Year
ISSN
eISSN
PUB-ID
Cite this
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.
This data publication is cited in the following publications:
This publication cites the following data publications:
Google Scholar