Synchronization in small-world systems.

By Mauricio Barahona, L. Pecora. Physical Review Letters, 2001

1,466 citations recorded by the source corpus.

We quantify the dynamical implications of the small-world phenomenon by considering the generic synchronization of oscillator networks of arbitrary topology. The linear stability of the synchronous state is linked to an algebraic condition of the Laplacian matrix of the network. Through numerics and analysis, we show how the addition of random shortcuts translates into improved network synchronizability. Applied to networks of low redundancy, the small-world route produces synchronizability more efficiently than standard deterministic graphs, purely random graphs, and ideal constructive schemes. However, the small-world property does not guarantee synchronizability: the synchronization threshold lies within the boundaries, but linked to the end of the small-world region.

Subfields: Computer Networks and Communications, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/f067de520d6abc6e0ef1672e895b3497a3ae09a5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Guanrong Chen
  2. Jürgen Kurths
  3. Albert-László Barabási
  4. Olaf Sporns
  5. Santo Fortunato
  6. Jinhu Lu
  7. Marc Barthelemy
  8. Alex Arenas

In Molecular Biology

  1. Olaf Sporns
  2. Santo Fortunato
  3. E. Bullmore
  4. D. Bassett
  5. Albert-László Barabási
  6. Alex Arenas
  7. Renaud Lambiotte
  8. Mark Newman

Citations in the corpus