title: Competition for shortest paths on sparse graphs.
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.
authors.affiliation: The Nonlinearity and Complexity Research Group, Aston University, Birmingham B4 7ET, United Kingdom.
authors.forename: Chi Ho
authors.initials: CH
authors.lastname: Yeung
authors.forename: David
authors.initials: D
authors.lastname: Saad