Competition for shortest paths on sparse graphs

Chi Ho YEUNG, David SAAD

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers. A distributed linearly scalable routing algorithm is also devised. Copyright © 2012 American Physical Society.
Original languageEnglish
Article number208701
JournalPhysical Review Letters
Volume108
Issue number20
DOIs
Publication statusPublished - May 2012

Fingerprint

communicating
congestion
topology
costs
ground state

Citation

Yeung, C. H., & Saad, D. (2012). Competition for shortest paths on sparse graphs. Physical Review Letters, 108(20). Retrieved from https://doi.org/10.1103/PhysRevLett.108.208701