Skip to main content
SpringerLink
Log in

Markov Chain Methods for Analyzing Urban Networks

  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Braess, D.: Über ein Paradoxon aus der Verkehrsplannung. Unternehmensforschung 12, 258–268 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kolata, G.: What if they closed the 42nd Street and nobody noticed? The New York Times, Dec. 25 (1990)

  3. Alexanderson, G.L.: Bull. Am. Math. Soc. 43, 567–573 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hillier, B., Hanson, J.: The Social Logic of Space. Cambridge University Press, Cambridge (1984). ISBN 0-521-36784-0

    Google Scholar 

  5. Hillier, B.: Space is the Machine: A Configurational Theory of Architecture. Cambridge University Press, Cambridge (1999). ISBN 0-521-64528-X

    Google Scholar 

  6. Rosvall, M., Trusina, A., Minnhagen, P., Sneppen, K.: Phys. Rev. Lett. 94, 028701 (2005)

    Article  ADS  Google Scholar 

  7. Cardillo, A., Scellato, S., Latora, V., Porta, S.: Phys. Rev. E 73, 066107 (2006)

    Article  ADS  Google Scholar 

  8. Porta, S., Crucitti, P., Latora, V.: Physica A 369, 853 (2006)

    Article  ADS  Google Scholar 

  9. Scellato, S., Gardillo, A., Latora, V., Porta, S.: Eur. Phys. J. B 50, 221 (2006)

    ADS  Google Scholar 

  10. Crucitti, P., Latora, V., Porta, S.: Chaos 16, 015113 (2006)

    Article  ADS  Google Scholar 

  11. Volchenkov, D., Blanchard, Ph.: Phys. Rev. E 75(2) (2007)

  12. Volchenkov, D., Blanchard, Ph.: Physica A 387(10), 2353–2364 (2008). doi:10.1016/j.physa.2007.11.049

    Article  ADS  Google Scholar 

  13. Gross, D., Harris, C.M.: Fundamentals of Queueing Theory. Wiley, New York (1998)

    MATH  Google Scholar 

  14. Backus, B.T., Oruç, I.: J. Vis. 5(11), 1055–1069 (2005)

    Google Scholar 

  15. Biggs, N.: Permutation Groups and Combinatorial Structures. Cambridge University Press, Cambridge (1979)

    MATH  Google Scholar 

  16. Blanchard, Ph., Volchenkov, D.: Intelligibility and first passage times in complex urban networks. Proc. R. Soc. A 464, 2153–2167 (2008). doi:10.1098/rspa.2007.0329

    Article  ADS  Google Scholar 

  17. Lagrange, J.-L.: Uvres, vol. 1, pp. 72–79. Gauthier-Villars, Paris (1867) (in French)

    Google Scholar 

  18. Lovász, L.: Combinatorics, Paul Erdös is Eighty. Bolyai Society Mathematical Studies, vol. 2, pp. 1–46. Bolyai Mathematical Society, Keszthely (1993)

    Google Scholar 

  19. Aldous, D.J., Fill, J.A.: Reversible Markov chains and random walks on graphs (in preparation). See http://www.stat.berkeley.edu/waldous/RWG/book.html

  20. Chung, F.: Lecture Notes on Spectral Graph Theory. AMS, Providence (1997)

    Google Scholar 

  21. Farkas, I.J., Derényi, I., Barabási, A.-L., Vicsek, T.: Phys. Rev. E 64, 026704 (2001)

    Article  ADS  Google Scholar 

  22. Farkas, I., Derényi, I., Jeong, H., Neda, Z., Oltvai, Z.N., Ravasz, E., Schubert, A., Barabási, A.-L., Vicsek, T.: Physic A 314, 25 (2002)

    Article  MATH  ADS  Google Scholar 

  23. Abramowitz, M., Stegun, I.A. (eds.): Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York (1972)

    MATH  Google Scholar 

  24. Sinai, Ya.G., Soshnikov, A.B.: Funct. Anal. Appl. 32(2), 114–131 (1998)

    Article  MathSciNet  Google Scholar 

  25. Arnold, L.: Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 19, 191–198 (1971)

    Article  Google Scholar 

  26. Alon, N., Krivelevich, M., Vu, V.H.: Isr. J. Math. 131, 259–267 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  27. Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F., Samukhin, A.N.: Phys. Rev. E 68, 046109 (2003)

    Article  MathSciNet  ADS  Google Scholar 

  28. Eriksen, K.A., Simonsen, I., Maslov, S., Sneppen, K.: Phys. Rev. Lett. 90(14), 148701 (2003)

    Article  ADS  Google Scholar 

  29. Chung, F., Lu, L., Vu, V.: Proc. Natl. Acad. Sci. USA 100(11), 6313–6318 (2003). Published online doi:10.1073/pnas.0937490100

    Article  MATH  MathSciNet  ADS  Google Scholar 

  30. Bollobás, B., Riordan, O.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks. Wiley, New York (2002)

    Google Scholar 

  31. Bianconi, G., Gulbahce, N., Motter, A.E.: Local structure of directed networks, 27 July 2007. E-print arXiv:0707.4084 [cond-mat.dis-nn]

  32. Chung, F.: Ann. Comb. 9, 1–19 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  33. Lovász, L., Winkler, P.: Mixing of random walks and other diffusions on a graph. In: Surveys in Combinatorics, Stirling. London Math. Soc. Lecture Note Ser., vol. 218, 119–154. Cambridge Univ. Press, Cambridge (1995)

    Google Scholar 

  34. Bjöner, A., Lovász, L., Shor, P.: Eur. J. Comb. 12, 283–291 (1991)

    Google Scholar 

  35. Bjöner, A., Lovász, L.: J. Algebr. Comb. 1, 305–328 (1992)

    Article  Google Scholar 

  36. Butler, S.: Electron. J. Linear Algebra 16, 90 (2007)

    MATH  MathSciNet  ADS  Google Scholar 

  37. Aubry, N., Guyonnet, R., Lima, R.: J. Stat. Phys. 64, 683–739 (1991)

    Article  MATH  MathSciNet  ADS  Google Scholar 

  38. Aubry, N.: Theor. Comput. Fluid Dyn. 2, 339–352 (1991)

    Article  MATH  Google Scholar 

  39. Karhunen, K.: Ann. Acad. Sci. Fenn. A 1 (1944)

  40. Loève, M.: Probability Theory. van Nostrand, New York (1955)

    MATH  Google Scholar 

  41. Aubry, N., Lima, L.: Spatio-temporal symmetries. Preprint CPT-93/P. 2923, Centre de Physique Theorique, Luminy, Marseille, France (1993)

Download references

Author information

Authors and Affiliations

  1. BiBoS, University Bielefeld, Postfach 100131, 33501, Bielefeld, Germany

    D. Volchenkov & P. Blanchard

Authors
  1. D. Volchenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Blanchard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Volchenkov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Volchenkov, D., Blanchard, P. Markov Chain Methods for Analyzing Urban Networks. J Stat Phys 132, 1051–1069 (2008). https://doi.org/10.1007/s10955-008-9591-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10955-008-9591-2

Keywords

Search

Navigation