Effect of Congestion Costs on Shortest Paths Through Complex Networks
- 9 February 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 94 (5) , 058701
- https://doi.org/10.1103/physrevlett.94.058701
Abstract
We analyze analytically the effect of congestion costs within a physically relevant, yet exactly solvable, network model featuring central hubs. These costs lead to a competition between centralized and decentralized transport pathways. In stark contrast to conventional no-cost networks, there now exists an optimal number of connections to the central hub in order to minimize the shortest path. Our results shed light on an open problem in biology, informatics, and sociology, concerning the extent to which decentralized versus centralized design benefits real-world complex networks.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Network Structures from Selection PrinciplesPhysical Review Letters, 2004
- Jamming is limited in scale-free systemsNature, 2004
- Optimal Paths in Disordered Complex NetworksPhysical Review Letters, 2003
- Noncircadian oscillations in amino acid transport have complementary profiles in assimilatory and foraging hyphae of Phanerochaete velutinaNew Phytologist, 2003
- Optimal Network Topologies for Local Search with CongestionPhysical Review Letters, 2002
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Topology of Evolving Networks: Local Events and UniversalityPhysical Review Letters, 2000
- Exactly solvable small-world networkEurophysics Letters, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998