pith. machine review for the scientific record. sign in

arxiv: 0803.3755 · v1 · submitted 2008-03-26 · ❄️ cond-mat.stat-mech

Recognition: unknown

Using relaxational dynamics to reduce network congestion

Authors on Pith no claims yet
classification ❄️ cond-mat.stat-mech
keywords congestiondynamicsnetworkspressurecorrespondingfamilygradientnetwork
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.