FIAS Scientific Report 2011 - Frankfurt Institute for Advanced Studies ...
FIAS Scientific Report 2011 - Frankfurt Institute for Advanced Studies ...
FIAS Scientific Report 2011 - Frankfurt Institute for Advanced Studies ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Complete and Clustered Synchronization in Complex Networks<br />
Collaborators: S. Becker 1 , M. Schäfer 1 , M. Greiner 2 , S. Schramm 1<br />
1 <strong>Frankfurt</strong> <strong>Institute</strong> <strong>for</strong> <strong>Advanced</strong> <strong>Studies</strong>, 2 Department of Mathematics, Aarhus University, Denmark<br />
We consider the dynamics of a complex network, consisting of N nodes and L links. The dynamics are given in<br />
the following way: Each node is assigned a (<strong>for</strong> simplicity scalar) variable xi ∈ [−1,1], which evolves in time<br />
according to<br />
x t+1<br />
i<br />
= (1 − ε) f (xt i) + ε<br />
N<br />
∑ Ai jg(x<br />
j=0<br />
t j),<br />
where f and g are bounded functions and Ai j is the adjacency matrix of the network (including suitable normalization).<br />
More specifically, we are interested in almost bipartite networks in the sense that in addition to the bipartite<br />
structure of links between two groups of nodes in a graph, there exist a few extra links within these two groups.<br />
We call the links between the two clusters “inter-cluster links” and the links within a cluster “intra-cluster<br />
links”. We look at the collective dynamics, i.e. the synchronization behavior of such systems. It has been noted<br />
in numerical studies that the presence of additional intra-cluster links may lead to enhanced synchronization,<br />
an analytical treatment of the problem is, however, still missing.<br />
To investigate the synchronization behavior, we have analytically re<strong>for</strong>mulated the problem in terms of a perturbed<br />
master stability approach. Due to the presence of the non-bipartite links, this does not decouple into a<br />
set of two-dimensional parametric equations, but remains N dimensional, however, since the coupling within<br />
the two clusters is small, we hope that we may be able to treat the synchronization perturbatively.<br />
As a complementary approach, we simulated bipartite networks numerically. On this route, we have succeeded<br />
to reproduce an important result on network synchronization, namely the effect that a small coupling ε leads to<br />
synchronization among connected nodes, while a large coupling causes those nodes to synchronize that are not<br />
connected, i.e. the two bipartite groups.<br />
Figure: Node-node plot of links and synchronization. In both figures, open circles indicate that the two nodes are synchronized,<br />
full circles represent links. Left: For small coupling (ε = 0.16), we observe synchronization among connected<br />
nodes (dominated by intra-cluster links). Right: Large coupling (ε = 0.80) leads to synchronization among the two<br />
bipartite groups (dominated by inter-cluster links).<br />
122