Competition for shortest paths on sparse graphs

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: Engineering & Applied Sciences > Mathematics
Engineering & Applied Sciences > Systems analytics research institute (SARI)
Additional Information: © APS
Uncontrolled Keywords: Physics and Astronomy(all)
Full Text Link: http://link.aps ... Lett.108.208701
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
Published Date: 2012-05-14
Authors: Yeung, Chi
Saad, David ( 0000-0001-9821-2623)

Download

[img]

Version: Accepted Version


Export / Share Citation


Statistics

Additional statistics for this record