• Rapid Communication

Jamming in complex gradient networks

Kwangho Park, Ying-Cheng Lai, Liang Zhao, and Nong Ye
Phys. Rev. E 71, 065105(R) – Published 28 June 2005

Abstract

Flows of physical quantities in large complex networks, natural or man made, rely in general on some scalar gradients existing in the networks. We investigate, analytically and numerically, under what conditions jamming in gradient flows can occur in random and scale-free networks. We find that the degree of jamming typically increases with the average connectivity k of the network. A crossover phenomenon is uncovered where for k<kc (kc denotes a critical connectivity, estimated to be about 10), scale-free networks have a higher level of congestion than random networks with the same k, while the opposite occurs for k>kc.

  • Figure
  • Figure
  • Figure
  • Received 28 March 2005

DOI:https://doi.org/10.1103/PhysRevE.71.065105

©2005 American Physical Society

Authors & Affiliations

Kwangho Park and Ying-Cheng Lai

  • Department of Electrical Engineering, Arizona State University, Tempe, Arizona 85287, USA

Liang Zhao

  • Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287, USA and Institute of Mathematics and Computer Science, University of São Paulo, Brazil

Nong Ye

  • Department of Industrial Engineering and Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona 85287, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 6 — June 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×