Markov Chain Methods For Analyzing Complex Transport Networks

Abstract

We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph representations of transport networks allowing for the effective network design, network performance evaluation, embedding, partitioning, and network fault tolerance analysis. Random walks embed graphs into Euclidean space in which distances and angles acquire a clear statistical interpretation. Being defined on the dual graph representations of transport networks random walks describe the equilibrium configurations of not random commodity flows on primary graphs. This theory unifies many network concepts into one framework and can also be elegantly extended to describe networks represented by directed graphs and multiple interacting networks.

26 pages, 4 figures

References in corpus (13)

• The Network Analysis of Urban Streets: A Primal Approach
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Structural Properties of Planar Graphs of Urban Street Patterns
• Spectra of complex networks
• Networks and Cities: An Information Perspective
• Modularity and Extreme Edges of the Internet
• Local structure of directed networks
• The Backbone of a City
• Networks in life: Scaling properties and eigenvalue spectra
• Scaling and Universality in City Space Syntax: between Zipf and Matthew
• Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics
• Intelligibility and First Passage Times In Complex Urban Networks
• Minimal volume entropy on graphs

Cited by in corpus (2)

• A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks
• Upper Expected Meeting Times for Interdependent Stochastic Agents