Yeung, Chi and Saad, David (2012). Competition for shortest paths on sparse graphs. Physical Review Letters, 108 (20),
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. © 2012 American Physical Society.
Publication DOI: | https://doi.org/10.1103/PhysRevLett.108.208701 |
---|---|
Divisions: | College of Engineering & Physical Sciences > School of Computer Science and Digital Technologies > Applied Mathematics & Data Science College of Engineering & Physical Sciences > Systems analytics research institute (SARI) |
Additional Information: | © APS |
Uncontrolled Keywords: | Physics and Astronomy(all) |
Publication ISSN: | 1079-7114 |
Full Text Link: |
http://link.aps ... Lett.108.208701 |
Related URLs: |
http://www.scop ... tnerID=8YFLogxK
(Scopus URL) |
PURE Output Type: | Article |
Published Date: | 2012-05-14 |
Authors: |
Yeung, Chi
Saad, David ( ![]() |