Optimization in gradient networks.

Gradient networks can be used to model the dominant structure of complex networks. Previous work has focused on random gradient networks. Here we study gradient networks that minimize jamming on substrate networks with scale-free and Erdos-Renyi structure. We introduce structural correlations and strongly reduce congestion occurring on the network by using a Monte Carlo optimization scheme. This optimization alters the degree distribution and other structural properties of the resulting gradient networks. These results are expected to be relevant for transport and other dynamical processes in real network systems.

[1]  Y. Lai,et al.  Jamming in complex gradient networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Adilson E. Motter,et al.  Maximum performance at minimum cost in network synchronization , 2006, cond-mat/0609622.

[3]  A. Motter,et al.  Synchronization is optimal in nondiagonalizable networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Adilson E. Motter,et al.  Dynamics on Complex Networks and Applications , 2006, cond-mat/0612068.

[5]  Harvey Gould,et al.  An Introduction to Computer Simulation Methods: Applications to Physical Systems (3rd Edition) , 2005 .

[6]  Gerard T. Barkema,et al.  Monte Carlo Methods in Statistical Physics , 1999 .

[7]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Yong Yu,et al.  Congestion-gradient driven transport on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Kevin E. Bassler,et al.  Network dynamics: Jamming is limited in scale-free systems , 2004, Nature.