arXiv Analytics

Sign in

arXiv:cond-mat/0409059AbstractReferencesReviewsResources

Effect of congestion costs on shortest paths through complex networks

Douglas J. Ashton, Timothy C. Jarrett, Neil F. Johnson

Published 2004-09-02, updated 2004-11-19Version 3

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.

Comments: Added a figure plus discussion of relevance to biological systems (e.g. fungi). Added details of derivation of analytic results
Journal: Phys Rev Lett 94, 058701 (2005)
Categories: cond-mat.dis-nn
Related articles:
arXiv:cond-mat/0205613 (Published 2002-05-29)
Scale-free Networks on Lattices
arXiv:cond-mat/0603515 (Published 2006-03-20)
Inhomogeneous substructures hidden in random networks