The Eureka Repository is closing down and will not be available after the end of 2020. All publications from current Faculty have now been migrated to Symplectic Elements. See the Sainsbury Library Blog for more information. ×

Using relaxational dynamics to reduce network congestion

Pastore Y Piontti, Ana, La Rocca, Cristian, Toroczkai, Zoltán, Braunstein, Lidia, Macri, Pablo and López, Eduardo (2008) Using relaxational dynamics to reduce network congestion. New Journal of Physics, 10. 093007.


We study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature bf 428, 716 (2004)). Using the Family model (F. Family, J. Phys. A, bf 19, L441 (1986)) from surface-growth physics as single-step load-balancing dynamics, we show that the congestion pressure considerably drops on scale-free networks when compared with the same dynamics on random graphs. This is due to a structural transition of the corresponding gradient network clusters, which self-organize such as to reduce the congestion pressure. This reduction is enhanced when lowering the value of the connectivity exponent lambda towards 2.

Item Type: Article
Keywords: Mathematical physics; Statistical physics; Nonlinear systems
Subject(s): Complexity
Centre: CABDyN Complexity Centre
Date Deposited: 25 Jan 2012 20:51
Last Modified: 31 Oct 2016 12:28

Actions (login required)

Edit View Edit View