Effect of shortest path multiplicity on congestion of multiplex networks

Abstract

Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial implications in the transportation efficiency and congestion processes. Here we present a mathematical approach to the computation of the joint distribution of distance and multiplicity (degeneration) of shortest paths in multiplex networks, and exploit its relation to congestion processes. The results allow to approximate semi-analytically the onset of congestion in multiplex networks as a function of the congestion of its layers.

arXiv comment13 pages, 4 figures. To appear in New Journal of Physics

References in corpus (24)

• Efficient Behavior of Small-World Networks
• Multilayer Networks
• The structure and dynamics of multilayer networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Cascade-based attacks on complex networks
• Universal Behavior of Load Distribution in Scale-free Networks
• Structural measures for multiplex networks
• The physics of spreading processes in multilayer networks
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Random Walks on Multiplex Networks
• Classification of scale-free networks
• Average path length in random networks
• Average path length in uncorrelated random networks with hidden variables
• Vertex overload breakdown in evolving networks
• Dynamical properties of model communication networks
• Congestion induced by the structure of multiplex networks
• Random walk centrality in interconnected multilayer networks
• An adaptive routing strategy for packet delivery in complex networks
• A model to identify urban traffic congestion hotspots in complex networks
• Stability of shortest paths in complex networks with random edge weights
• Distance distribution in random graphs and application to networks exploration
• Decongestion of urban areas with hotspot-pricing
• The distribution of shortest path lengths in a class of node duplication network models

Cited by in corpus (6)

• Comprehensive routing strategy on multilayer networks
• Optimal transport in multilayer networks for traffic flow optimization
• Scaling in the recovery of urban transportation systems from special events
• Multiple abrupt phase transitions in urban transport congestion
• Emergence of spatial transitions in urban congestion dynamics
• Multiplex Markov Chains: Convection Cycles and Optimality