Markov Chain methods for analyzing urban networks

Dimitri Volchenkov; P. Blanchard

Markov Chain methods for analyzing urban networks

Dimitri Volchenkov, P. Blanchard

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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. © 2008 Springer Science+Business Media, LLC.

Original language	English
Pages (from-to)	1051-1069
Journal	Journal of Statistical Physics
State	Published - Sep 1 2008

Cite this

@article{3ceaf9ff5fba42e3bb280ab834f60d2d,

title = "Markov Chain methods for analyzing urban networks",

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. {\textcopyright} 2008 Springer Science+Business Media, LLC.",

author = "Dimitri Volchenkov and P. Blanchard",

note = "Funding Information: Acknowledgement The work has been supported by the Volkswagen Foundation (Germany) in the frame-work of the project: “Network formation rules, random set graphs and generalized epidemic processes” (Contract no Az.: I/82 418).",

year = "2008",

month = sep,

day = "1",

language = "English",

pages = "1051--1069",

journal = "Journal of Statistical Physics",

issn = "0022-4715",

}

TY - JOUR

T1 - Markov Chain methods for analyzing urban networks

AU - Volchenkov, Dimitri

AU - Blanchard, P.

N1 - Funding Information: Acknowledgement The work has been supported by the Volkswagen Foundation (Germany) in the frame-work of the project: “Network formation rules, random set graphs and generalized epidemic processes” (Contract no Az.: I/82 418).

PY - 2008/9/1

Y1 - 2008/9/1

N2 - 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. © 2008 Springer Science+Business Media, LLC.

AB - 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. © 2008 Springer Science+Business Media, LLC.

M3 - Article

AN - SCOPUS:50249175562

SN - 0022-4715

SP - 1051

EP - 1069

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

ER -

Markov Chain methods for analyzing urban networks

Abstract

Fingerprint

Cite this