Synchronization of networks with prescribed degree distributions

We show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, there exists a connected graph having that degree sequence for which the first nontrivial eigenvalue of the graph Laplacian is arbitrarily close to zero. Consequently, complex dynamical systems defined on such graphs have poor synchronization properties. The result holds under quite mild assumptions, and shows that there exists classes of random, scale-free, regular, small-world, and other common network architectures which impede synchronization. The proof is based on a construction that also serves as an algorithm for building nonsynchronizing networks having a prescribed degree distribution.

[1]  Jerrold W. Grossman,et al.  A portion of the well-known collaboration graph , 1995 .

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

[3]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[4]  J. Milnor.  On the concept of attractor , 1985 .

[5]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[6]  Regina Tyshkevich,et al.  Lectures on Graph Theory , 1994 .

[7]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[8]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[9]  J. Jost,et al.  Spectral properties and synchronization in coupled map lattices. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  P. Grassberger,et al.  Symmetry breaking bifurcation for coupled chaotic attractors , 1991 .

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[14]  Adilson E Motter,et al.  Heterogeneity in oscillator networks: are smaller worlds easier to synchronize? , 2003, Physical review letters.

[15]  Claude Berge,et al.  Lectures on graph theory , 1967 .

[16]  Guanrong Chen,et al.  Synchronization and desynchronization of complex dynamical networks: an engineering viewpoint , 2003 .

[17]  I. Stewart,et al.  Bubbling of attractors and synchronisation of chaotic oscillators , 1994 .

[18]  J. Jost,et al.  Evolving networks with distance preferences. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Jürgen Kurths,et al.  Synchronization: Phase locking and frequency entrainment , 2001 .

[20]  Yuri Maistrenko,et al.  An introduction to the synchronization of chaotic systems: coupled skew tent maps , 1997 .

[21]  A. Rapoport,et al.  Connectivity of random nets , 1951 .

[22]  Jürgen Jost,et al.  Delays, connection topology, and synchronization of coupled chaotic maps. , 2004, Physical review letters.

[23]  P. McClintock.  Synchronization:a universal concept in nonlinear science , 2003 .

[24]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[25]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[26]  Jürgen Kurths,et al.  Synchronization - A Universal Concept in Nonlinear Sciences , 2001, Cambridge Nonlinear Science Series.

[27]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[28]  Mauricio Barahona,et al.  Synchronization in small-world systems. , 2002, Physical review letters.