## Figures

## Abstract

An initial unsynchronized ensemble of networking phase oscillators is further subjected to a growing process where a set of forcing oscillators, each one of them following the dynamics of a frequency pacemaker, are added to the pristine graph. Linking rules based on dynamical criteria are followed in the attachment process to force phase locking of the network with the external pacemaker. We show that the eventual locking occurs in correspondence to the arousal of a scale-free degree distribution in the original graph.

**Citation: **Sendiña-Nadal I, Buldú JM, Leyva I, Boccaletti S (2008) Phase Locking Induces Scale-Free Topologies in Networks of Coupled Oscillators. PLoS ONE 3(7):
e2644.
https://doi.org/10.1371/journal.pone.0002644

**Editor: **Eshel Ben-Jacob, Tel Aviv University, Israel

**Received: **May 30, 2008; **Accepted: **June 9, 2008; **Published: ** July 9, 2008

**Copyright: ** © 2008 Sendina Nadal et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Funding: **Work partly supported by the Spanish Ministry of Science and Technology under Project No. FIS2006-08525, the URJC-CM Projects Nos. 2006-CET-0643 and 2007-CET-1601, and the European Project GABA.

**Competing interests: ** The authors have declared that no competing interests exist.

## Introduction

Many biological, neural, chemical and technological systems find a suitable representation as growing networks of interconnected dynamical units [1]–[3]. It is nowadays established that such networks, as they are observed in their mature state, are characterized by specific topological features, as, for instance, relatively small characteristic distances between any two nodes, high clustering properties, and fat tailed shapes in the distribution of their connectivities. In particular, most of them are known to exhibit the so-called scale-free (SF) property [4] consisting in the fact that they feature a power-law distribution *P*(*k*)∼*k*^{−γ} in the node connectivity *k* (degree). From the other side, it is observed that their complex functioning and organization is often associated with the adjustment of all (or a relevant portion of) their dynamical components into a collective synchronized motion.

It is therefore crucial to understand the intimate relationship between the topological structure displayed in the resulting graphs, and the mechanisms leading to the arousal of such synchronized behaviors. For instance, recent studies have shown that *i)* the ability of a graph to give rise to a synchronous behavior can be greatly enhanced by exploiting the topological structure emerging from independent statistically driven growth processes [5]–[7]; *ii)* proper topological mechanisms of rewiring/decoupling can enhance the arousal of a synchronized behavior [8]; *iii)* a dynamical evolution of the underlying topology of a graph is eventually able to stabilize a synchronous motion also in those cases in which synchronization would be prevented in static graph configurations [9]–[11].

However, the question of how node dynamics can shape the network has not been extensively addressed. The issue has only been considered within the game theory framework [12], [13], where a not growing network of players is shaped in a decision game. In this Letter, we show that a growing process entirely guided by dynamical criteria to force frequency and phase locking of an original set of networking oscillators is able to fully reshape the connectivity of the graph, and that the entrainment process induces a scale-free degree distribution in the pristine network.

## Methods

Without lack of generality, we exemplify our discussion with reference to an initial *t* = 0 graph G_{0} of bi-directionally coupled Kuramoto phase oscillators [14], [15], ruled by where *i* runs from 1 to *n*_{1}, {*ω*_{0i}} is the set of natural frequencies of the phase oscillators, uniformly distributed within the range 0.5±0.25, *k _{i}*(

*t*= 0) is the initial degree of (the number of connections pertinent to) the

*i*oscillator,

^{th}*d*

_{1}is a coupling constant, and the set {

*a*} are the elements of the

_{ij}*n*

_{1}×

*n*

_{1}adjacency matrix

**A**= (

*a*) describing the structure and topology of the wiring of connections in G

_{ij}_{0}(

*a*= 1 if oscillators

_{ij}*i*and

*j*are connected, while

*a*= 0 otherwise). Time integration is here performed by means of the Heun method with an integration step Δ

_{ij}*t*= 0.1.

_{in}Though the main results of our study are independent on the initial choice of G_{0}, from the time being we generate G_{0} by means of the model introduced in Ref. [16]. Precisely, we start with a ring lattice of *n*_{1} nodes, each one connected to its *k*_{0i} = 2*m*_{0} nearest neighbors, and obtain G_{0} by randomly rewiring each link with probability *p* = log *n*_{1}/*n*_{1}. The resulting G_{0} approximates the so called *small world* property, featuring an average shortest path length ∝ log *n*_{1}, and an exponentially decaying degree distribution *P*_{0}(*k*) that is well peaked around the mean value 〈*k*〉 = 2*m*_{0}. Furthermore, the coupling constant *d*_{1} is selected so as the initial graph does not display a phase synchronized motion.

In our generic trials, the initial network G_{0} is let evolve in its unsynchronized motion from *t* = 0 to *t* = 30 time units, and, at subsequent times *t _{l}* =

*t*

_{0}+

*l*Δ

*t*, a forcing network is grown on top of the evolution of G

_{0}. Namely, at each time interval Δ

*t*(which will be taken as a multiple of the integration step Δ

*t*, i.e. Δ

_{in}*t*=

*s*Δ

*t*), a new node is added, forming

_{in}*m*connections with nodes in G

_{0}. The added nodes are identical phase oscillators that follow the instantaneous phase of an external pacemaker , and all newly formed links correspond to unidirectional (forcing) interactions to nodes in G

_{0}. Notice that such forcing process is fully equivalent to considering a unique external forcing node (the pacemaker) which forms successive (and possibly multiple) connections with oscillators in G

_{0}in the attempt of locking their frequencies, and, as so, it can be taken as a representation of phenomena occurring in social science [the emergence of consensus driven by a leader opinion (media, press, fashion, publicity, etc..)] or in biological systems (the entrainment of circadian rhythms driven by the main circadian clock).

The key point is the selection mechanism through which the added nodes are linked to G_{0}. We here consider a dynamical criterion fully driven to enhance phase locking: when the *l ^{th}* new node is attached to G

_{0}, it forms

*m*connections

*preferentially*with those nodes in G

_{0}whose instantaneous phase at time

*t*,

_{l}*φ*(

_{j}*t*), holds more closely a given phase condition. Specifically, we consider a generic parameter

_{l}*δ*∈(0,2

*π*) and establish the first of the

*m*connections with that node

*j*whose actual value of the phase holds the condition with Δ

_{l}*θ*=

_{j}*φ*(

_{j}*t*)−

_{l}*φ*(

_{p}*t*). When

_{l}*m*>1, we iteratively repeat the same condition excluding those nodes that already received a link at the same time step. In the following, we will set

*m*= 1. However, the reported scenario is independent on the specific choice of

*m*, the only difference being that for

*m*= 1, the added nodes do not form additional cycles nor loops in the original graph G

_{0}. As for the parameter

*δ*, we will show that it will not affect qualitatively the reported scenario. The only constrain is that it cannot be taken equal to 0 nor to 2

*π*, as these values correspond to the stable fixed point emerging during the locking of a single phase oscillator, and therefore these settings would determine a situation in which the first node in G

_{0}becoming locked with the pacemaker, would, from there on, attract all the rest of connections.

Each newly formed connection is assigned a coupling coefficient *d _{p}* and a coupling direction from the added node to the selected node in G

_{0}(different kinds of coupling interactions have been also studied, and a detailed report will be presented elsewhere [17]). The evolution of the graph is therefore described bywhere

*k*(

_{i}*t*) is the time evolving degree of the

*i*node that accounts for new connections the

^{th}*i*node is receiving from added nodes, and the matrix

^{th}**B**= (

*b*) is a size evolving matrix of

_{ij}*n*

_{1}×

*l*(

*t*) elements (with

*l*(

*t*)≤

*n*

_{2}), whose entries

*b*are equal to 1 if the

_{ij}*j*added node formed a connection with the

^{th}*i*node in G

^{th}_{0}, and zero otherwise.

## Results

Figure 1 reports the quantity *R* = 〈*R*(*t*)〉* _{t} vs*. the parameter space (

*ω*,

_{p}*d*) for

_{p}*n*

_{1}= 100,

*d*

_{1}= 0.2,

*n*

_{2}= 200,

*s*= 1, and

*δ*=

*π*(anti-phase coupling condition). Here 〈…〉

*denotes an average over time (performed after the growing process is finished), and*

_{t}*R*(

*t*) stands for the phase synchronization order parameter [14] .

Time averaged phase synchronization order parameter *R* (see text for definition) as a function of both the pacemaker frequency *ω _{p}* and the coupling strength

*d*. Parameters:

_{p}*n*

_{1}= 100,

*d*

_{1}= 0.2,

*m*

_{0}= 2,

*n*

_{2}= 200,

*δ*=

*π*and each point is an average over 10 different realizations of the growing process.

From Figure 1 it is evident that the threshold for the setting of the phase locking of *R*(*t*) (*R*≃1) crucially depends on the frequency of the external pacemaker *ω _{p}*. Specifically, as far as

*ω*is close to

_{p}*ω̅*= 0.5 (the average frequency of the oscillators in G

_{0}), the locking process occurs already for a relatively small value of

*d*, whereas, as

_{p}*ω*deviates significantly from

_{p}*ω̅*the value of

*d*producing phase locking becomes larger and larger. A more quantitative description of the process can be gathered by inspection of Figure 2, where we report the time evolution of the mean frequency of the oscillators in G

_{p}_{0}, , of its frequency dispersion , and of

*R*(

*t*), for three pacemaker frequencies (

*ω*= 0.1, 0.5 and 0.9) and two distinct coupling strengths (

_{p}*d*= 0.5 and

_{p}*d*= 5.5). It is seen that, while the low coupling regime is not associated to a phase locking of G

_{p}_{0}with the pacemaker, in the high coupling regime

*ω*(

*t*) converges (after the growing process has ended) to the external forcing frequency and, at the same time

*R*(

*t*) converges to unity, and

*σ*(

_{ω}*t*) vanishes.

Time evolution of the mean frequency (upper row), frequency dispersion (middle row) and phase synchronization order parameter (lower row) for three pacemaker frequencies (*ω _{p}* = 0.1 red-dotted line,

*ω*= 0.5 blue-solid line, and

_{p}*ω*= 0.9 black-dashed line) and coupling strengths

_{p}*d*= 0.5 (left column) and

_{p}*d*= 5.5 (right column). See text for the definition of all reported quantities. The two vertical lines in the upper row denote the instants at which the growth process starts (dashed) and ends (continuous). Same parameters as in the caption of Figure 1.

_{p}The results reported in Figures 1 and 2 are generic, and the same qualitative scenario (though for different values of *d _{p}* and

*ω*) characterizes the evolution of the system at different system sizes, for different initial topologies in the connectivity of G

_{p}_{0}, for different values of

*δ*∈(0,2

*π*) and for different values of

*m*.

Let us now move to report the central point of this study, related to the investigation of the peculiar topological structures induced in the final degree distribution of G_{0} as a result of the phase locking process. For instance, in Figure 3 we depict the final graphs obtained for *n*_{1} = 100 and *n*_{2} = 1000, with the nodes of the original graph (the added nodes) depicted in black (blue). The left and right networks correspond to very different situations. In the left network, the growing process is unable to produce locking of the phases of the oscillators in G_{0} to the external pacemaker, and one sees that the distribution of blue attachments is rather homogeneous. At variance, the right graph corresponds to a case in which the forcing nodes eventually succeed to entrain the phases of the oscillators in G_{0}, and eye inspection reveals a high heterogeneity of the blue attachments, with the simultaneous presence of few hubs (nodes with very high degree) and many seldomly connected nodes.

These two networks are constructed for *n*_{1} = 100, *n*_{2} = 1000, and *δ* = *π*. The nodes of the original graph are depicted in black, the forcing nodes are depicted in blue. The left (right) network corresponds to a case in which the forcing nodes are unable (able) to lock the phases of the oscillators in G_{0}.

In order to describe more quantitatively the situation, we perform large trials of numerical simulations with *n*_{1} = 1000, *n*_{2} = 10000, and *d*_{1} = 0.2, and we monitor the time evolution of the degree distribution *P _{t}*(

*k*) of all nodes originally belonging to G

_{0}during the process of locking. In fact, we here measure the

*cumulative*degree distribution , given by . This is because the summing process of the

*P*(

*k*) smooths the statistical fluctuations generally present in the tails of the distribution. As a generic property, it is important to remark that, if a power law scaling is observed in the behavior of

*P*(

^{c}*k*) (i.e. if ), this implies that also the degree distribution

*P*(

*k*) is characterized by a power law scaling

*P*(

*k*)∼

*k*

^{−γ}, with

*γ*= 1+

*γ*.

_{c}Figure 4 reports how evolves in two distinct situations: for a process that does not lead to any locking (left panel) and for a process that eventually leads to locking of G_{0} to the frequency of the pacemaker (right panel). In the former case, while deviates significantly from in the course of time, it never assumes a power-law shape, while in the latter case the locking process (manifested by the evolution of *R*(*t*) to 1 in the inset) is accompanied by the convergence of to an asymptotic distribution which features a power-law shape.

*ω _{p}* = 0.5 and

*d*= 0.2 (left panel, non locked graph) and

_{p}*d*= 0.5 (right panel locked graph). In both cases the inset reports the corresponding time evolution of

_{p}*R*(

*t*) (see text for definition). The time instants at which the distributions are taken (indicated by arrows in the insets) are:

*t*= 0 (*);

*t*= 200 (+);

*t*= 500 (◊);

*t*= 800 (○);

*t*= 1000 (□). Notice that, in the locked case, converges to an asymptotic distribution which features a power-law shape (best fit sketched with red dashed line).

The difference in the final distributions for the non locked and locked networks, and the convergence in this latter case of to a SF distribution is a generic feature in the parameter space, as it can be seen in Figures 5(a)–(c). There, we report log-log plots of obtained after an ensemble average over 50 different realizations of the growing process for *n*_{1} = 1000, *n*_{2} = 10000, *d*_{1} = 0.2 and two distinct values of *δ* [*δ* = *π* in Figures 5(a)–(b), and *δ* = *π*/4 in Figure **5**(c)]. In all cases, solid (dashed) lines correspond to the locked (non locked) regime, obtained for high (low) values of *d _{p}*, and solid red lines indicate the best power-law fits. Whenever the forcing nodes eventually induce the locking of G

_{0}to the pacemaker frequency, the final degree distribution displays a power-law (scale-free) behavior

*P*(

*k*)∼

*k*

^{−γ}. The specific slope

*γ*of the power law scaling depends on the specific choice of the external frequency

*ω*. In our trials, we always observed values of

_{p}*γ*in the range (2,3), in accordance to the values measured for most of the real world networks [1]–[3].

(a)–(c): Log-log plots of (see text for definition) *vs. k.* obtained after an ensemble average over 50 different realizations of the growing process (*n*_{1} = 1000, *n*_{2} = 10000, *d*_{1} = 0.2). In all cases, solid (dashed) lines correspond to the locked (non locked) regime, obtained for high (low) values of *d _{p}*, and solid red lines indicate the best power-law fits. (d): final number of connections

*k*(

_{i}*t*) acquired by each node as a function of its initial frequency

_{fin}*ω*

_{0i}= 0.5 for,

*δ*=

*π*, and

*d*= 0.2 (upper plot, unlocked case) and

_{p}*d*= 0.5 (lower plot, locked case).

_{p}## Discussion

The formation of a scale free degree distribution can be qualitatively understood as follows. Each node in G_{0} can be in two different states: a state in which its phase is locked with that of the pacemaker (corresponding to Δ*θ* = 0) and an unlocked state, in which Δ*θ*(*t*) rotates in the unit circle clockwise or counterclockwise, depending on whether the difference between the frequency of the node and that of the pacemaker is positive or negative. Having set *δ* strictly different from 0, this implies that, once a node reaches the locked state, it cannot be further attached by the pacemaker. As a given node is connected to the pacemaker, it is reasonable to assume that its phase dynamics will be slightly attracted to that of the pacemaker. Initially, all nodes are not locked, and therefore the probability to find their phase differences in the proximity of the attachment condition will not depend on their specific initial frequency. When *d _{p}* is small enough so as not to determine locking of the network, only the very few nodes whose original frequency was close to that of the pacemaker will reach the locked state, whereas all the remaining nodes will evolve unsynchronized, and for them we will have a sort of random attachment with equal probability leading to a final degree distribution which substantially differs from a scale free network (Figures 5(a)–(c), dashed lines). On the contrary, at high values of

*d*, nodes will be sequentially attracted to the locked state, starting again from those whose original frequency was close to that of the pacemaker. In this latter situation, the more nodes gets the locked state (where any further attachment is prevented), the higher is the probability that the remaining unlocked nodes will get subsequent connections, resulting in a kind of preferential attachment process in which the higher is the absolute value of the difference between the original frequency of a node and that of the pacemaker, the higher is the chance that this node will get connections during the growing process. This is confirmed in Fig. 5(d), where we report the final number of connections

_{p}*k*(

_{i}*t*) acquired by each node as a function of its initial frequency

_{fin}*ω*

_{0i}for

*ω*= 0.5 and two values of

_{p}*d*. There, one clearly see that, while in the unlocked regime (upper plot) the distribution is almost uniform reflecting a random-like attachment, in the locked regime (lower plot), the distribution is strongly nonuniform, and promotes those nodes with higher frequency mismatch with the pacemaker. Notice that the few points in Figure 5(d) of high degree in proximity to

_{p}*ω*correspond to oscillators whose initial frequency was, indeed, close to

_{p}*ω*, but whose instantaneous frequency at the instant at which the growing process starts was moved away from

_{p}*ω*during the initial, unforced, evolution of G

_{p}_{0}.

In conclusion, we have shown that a growing process entirely guided by dynamical criteria to promote and phase locking of an original network is able in a robust way to fully reshape the connectivity of the graph, and that the locking process is associated with the emergence of a scale-free degree distribution in the network connectivity. This fact can therefore give new hints on the fundamental processes that rule the growth of some of the real world networks, that ubiquitously feature such kind of connectivity distributions.

## Author Contributions

Analyzed the data: SB IS JB IL. Contributed reagents/materials/analysis tools: SB IS JB IL. Wrote the paper: SB IS JB IL.

## References

- 1. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74: 47–97.R. AlbertAL Barabási2002Statistical mechanics of complex networks.Rev Mod Phys744797
- 2. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45: 167–256.MEJ Newman2003The structure and function of complex networks.SIAM Rev45167256
- 3. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424: 175–308.S. BoccalettiV. LatoraY. MorenoM. ChavezD-U Hwang2006Complex networks: structure and dynamics.Phys Rep424175308
- 4. Barabási AL, Albert R (1999) Emergence of Scaling in Random Networks. Science 286: 509–512.AL BarabásiR. Albert1999Emergence of Scaling in Random Networks.Science286509512
- 5. Motter AE, Zhou C, Kurths J (2005) Network synchronization, diffusion, and the paradox of heterogeneity. Phys Rev E 71: 016116(9).AE MotterC. ZhouJ. Kurths2005Network synchronization, diffusion, and the paradox of heterogeneity.Phys Rev E71016116(9)
- 6. Chavez M, Hwang H-U, Amann A, Hentschel HE, Boccaletti S (2005) Synchronization is Enhanced in Weighted Complex Networks. Phys Rev Lett 94: 218701(4).M. ChavezH-U HwangA. AmannHE HentschelS. Boccaletti2005Synchronization is Enhanced in Weighted Complex Networks.Phys Rev Lett94218701(4)
- 7. Hwang D-U, Chavez M, Amann A, Boccaletti S (2005) Synchronization in Complex Networks with Age Ordering. Phys Rev Lett 94: 138701(4).D-U HwangM. ChavezA. AmannS. Boccaletti2005Synchronization in Complex Networks with Age Ordering.Phys Rev Lett94138701(4)
- 8. Yin C-Y, Wang W-X, Chen G, Wang B-H (2006) Decoupling process for better synchronizability on scale-free networks. Phys Rev E 74: 047102(4).C-Y YinW-X WangG. ChenB-H Wang2006Decoupling process for better synchronizability on scale-free networks.Phys Rev E74047102(4)
- 9. Belykh V, Belykh VN, Hasler M (2004) Blinking model and synchronization in small-world networks with a time-varying coupling. Physica D 195: 188–206.V. BelykhVN BelykhM. Hasler2004Blinking model and synchronization in small-world networks with a time-varying coupling.Physica D195188206
- 10. Stilwell DJ, Bollt EM, Roberson DG (2006) Sufficient Conditions for Fast Switching Synchronization in Time-Varying Network Topologies. SIAM J Appl Dyn Syst 5: 140.DJ StilwellEM BolltDG Roberson2006Sufficient Conditions for Fast Switching Synchronization in Time-Varying Network Topologies.SIAM J Appl Dyn Syst5140
- 11. Boccaletti S, Hwang D-U, Chavez M, Amann A, Kurths J, Pecora LM (2006) Synchronization in dynamical networks: Evolution along commutative graphs. Phys Rev E 74: 016102(5).S. BoccalettiD-U HwangM. ChavezA. AmannJ. KurthsLM Pecora2006Synchronization in dynamical networks: Evolution along commutative graphs.Phys Rev E74016102(5)
- 12. Ebel H, Bornholdt S (2002) Evolutionary games and the emergence of complex networks. Eprint cond-mat/0211666. H. EbelS. Bornholdt2002Evolutionary games and the emergence of complex networks.Eprint cond-mat/0211666
- 13. Zimmermann MG, Eguíluz VM, San Miguel M (2004) Coevolution of dynamical states and interactions in dynamic networks. Phys Rev E 69: 065102(4).MG ZimmermannVM EguíluzM. San Miguel2004Coevolution of dynamical states and interactions in dynamic networks.Phys Rev E69065102(4)
- 14.
Kuramoto Y (1984) Chemical Oscillations, Waves, and Turbulence. Berlin: Springer. Y. Kuramoto1984Chemical Oscillations, Waves, and TurbulenceBerlinSpringer
- 15. Strogatz SH (2000) From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators. Physica D 143: 1–20.SH Strogatz2000From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators.Physica D143120
- 16. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393: 440.DJ WattsSH Strogatz1998Collective dynamics of ‘small-world’ networks.Nature393440
- 17.
Leyva I, Sendiña–Nadal I, Buldú JM, Boccaletti SI. LeyvaI. Sendiña–NadalJM BuldúS. Boccalettiin preparation. in preparation.