Synchronization processes in complex networks

DOI10.1016/J.PHYSD.2006.09.029MaRDI QIDQ858502zbMATH OpenOpenAlexWikidataFDO

Authors Alex Arenas, Albert Diaz-Guilera, Conrad J. Pérez-Vicente

Publication date 9 January 2007

Published in Physica D (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/nlin/0610057

complex networks spectral analysis synchronization

Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Asymptotic properties of solutions to ordinary differential equations (34D05) Applications of graph theory to circuits and networks (94C15)

Abstract: We present an extended analysis, based on the dynamics towards synchronization of a system of coupled oscillators, of the hierarchy of communities in complex networks. In the synchronization process, different structures corresponding to well defined communities of nodes appear in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology and spectral graph analysis.

Review text

This paper presents a numerical study of the process of synchronization in networks of \(N\) oscillators of the Kuramoto type, described by the system of differential equations \[ \frac{d\theta_i}{dt}=\omega +\sum_{j}K_{ij}\sin(\theta_j-\theta_i),\quad i=1,\dots N. \] The focus is on the way that the network structure, which is determined by the coefficients \(K_{ij}\), determines the gradual synchronization of the system in time: when the network consists of ``communities of densely-coupled oscillators, with sparser inter-connections among oscillators in different communities. The process of synchronization reflects this fact: the oscillators in a given community synchronize on a faster time scale, and the different communities synchronize at a later time. Several examples are studied, and several graphical representations are displayed, which show this process. Another manifestation of the network structure, which is discussed in this paper, is the spectrum of the Laplacian matrix of the network. The numerical results also show a resemblance between: (1) the graph displaying the number of synchronize clusters of oscillators versus time, and: (2) the graph showing the inverse of the \(k\)th eigenvalue of the Laplacian matrix versus \(k\). A heuristic explanation for this similarity is given.

Recommendations

Cites work

Cited in

(62)

This page was built for publication: Synchronization processes in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858502)