Jamming in complex gradient networks

Kwangho Park, Ying-Cheng Lai, Liang Zhao, N Ye

Research output: Contribution to journalArticle

63 Citations (Scopus)

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 >< k(c) (k(c) 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 >> k(c).

Original languageEnglish
Article number065105
Number of pages4
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume71
Issue number6
DOIs
Publication statusPublished - Jun 2005

Cite this