27,843 research outputs found
Synchronization in random networks with given expected degree sequences
Synchronization in random networks with given expected degree sequences is studied. We also investigate in details the synchronization in networks whose topology is described by classical random graphs, power-law random graphs and hybrid graphs when N goes to infinity. In particular, we show that random graphs almost surely synchronize. We also show that adding small number of global edges to a local graph makes the corresponding hybrid graph to synchroniz
Synchronization reveals topological scales in complex networks
We study the relationship between topological scales and dynamic time scales
in complex networks. The analysis is based on the full dynamics towards
synchronization of a system of coupled oscillators. In the synchronization
process, modular structures corresponding to well defined communities of nodes
emerge in different time scales, ordered in a hierarchical way. The analysis
also provides a useful connection between synchronization dynamics, complex
networks topology and spectral graph analysis.Comment: 4 pages, 3 figure
Synchronization processes in complex networks
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.Comment: 16 pages, 4 figures. To appear in Physica D "Special Issue on
dynamics on complex networks
Cluster synchronization in networks of coupled non-identical dynamical systems
In this paper, we study cluster synchronization in networks of coupled
non-identical dynamical systems. The vertices in the same cluster have the same
dynamics of uncoupled node system but the uncoupled node systems in different
clusters are different. We present conditions guaranteeing cluster
synchronization and investigate the relation between cluster synchronization
and the unweighted graph topology. We indicate that two condition play key
roles for cluster synchronization: the common inter-cluster coupling condition
and the intra-cluster communication. From the latter one, we interpret the two
well-known cluster synchronization schemes: self-organization and driving, by
whether the edges of communication paths lie at inter or intra-cluster. By this
way, we classify clusters according to whether the set of edges inter- or
intra-cluster edges are removable if wanting to keep the communication between
pairs of vertices in the same cluster. Also, we propose adaptive feedback
algorithms on the weights of the underlying graph, which can synchronize any
bi-directed networks satisfying the two conditions above. We also give several
numerical examples to illustrate the theoretical results
Synchronization in small-world systems
We quantify the dynamical implications of the small-world phenomenon. We
consider the generic synchronization of oscillator networks of arbitrary
topology, and link the linear stability of the synchronous state to an
algebraic condition of the Laplacian of the graph. We show numerically that the
addition of random shortcuts produces improved network synchronizability.
Further, we use a perturbation analysis to place the synchronization threshold
in relation to the boundaries of the small-world region. Our results also show
that small-worlds synchronize as efficiently as random graphs and hypercubes,
and more so than standard constructive graphs
- …