Skip to main content
PMC home page
Scientific Reports logoLink to Scientific Reports
. 2012 Dec 14;2:967. doi: 10.1038/srep00967

Evolutionary design of non-frustrated networks of phase-repulsive oscillators

Zoran Levnajić 1,a
PMCID: PMC3522069  PMID: 23243494

Abstract

Evolutionary optimisation algorithm is employed to design networks of phase-repulsive oscillators that achieve an anti-phase synchronised state. By introducing the link frustration, the evolutionary process is implemented by rewiring the links with probability proportional to their frustration, until the final network displaying a unique non-frustrated dynamical state is reached. Resulting networks are bipartite and with zero clustering. In addition, the designed non-frustrated anti-phase synchronised networks display a clear topological scale. This contrasts usually studied cases of networks with phase-attractive dynamics, whose performance towards full synchronisation is typically enhanced by the presence of a topological hierarchy.

Study of collective phenomena in complex systems has been massively enhanced in the last decade by introduction of the complex networks framework1. This revolutionised our understanding of the real complex systems, ranging from gene and neuron networks, to air traffic, Internet and society2. This paradigm allowed for novel theoretical and computational investigations, such as stability of gene regulatory networks examined through the network-inhibition of chaos3, or detection of communities in social networks4.

The phenomenon of synchronisation occupies a prominent place in the networks science, as a par excellence example of emergent collective behaviour5. Synchronisation of various kinds of oscillating dynamical units have been extensively studied both theoretically6 and experimentally7. Kuramoto oscillators8,9 allowed for the emergence of synchronisation to be examined in great detail5,6, due to being conceptually simple and easy to implement numerically. This model is often used in theoretical and experimental studies, such as network reconstruction10, or modelling of neural phase-resetting curves11.

In parallel with synchronisation, research attention was devoted to various forms of anti-synchronisation12. This particularly refers to anti-phase synchronisation13, where the interacting oscillator pairs evolve towards having the opposite phases, i.e. towards being synchronised with a fixed phase difference π. In this context, networks of units with the repressive and/or repulsive interactions were investigated. Most famously, the system of repressively interacting genes – repressilator – received much attention14,15,16. Repulsive interactions can generate dynamical frustration and multistability, since interacting units cannot always relax to a unique equilibrium state17,18. Neurons are often coupled repulsively, which was examined theoretically19,20 and experimentally21,22. In addition, repulsive Kuramoto oscillators can be used to model social interactions and social equilibria23,24, or suppression of synchronisation25.

Recently, complex networks of Kuramoto oscillators will solely repulsive coupling were examined26, in opposition to studies involving both attractive and repulsive interactions27. By borrowing the terminology from disordered systems28, the dynamical states in these networks were characterised by defining the link frustration f. In general, complex networks were found to have positive total frustration, due to complexity of their topologies. In addition, depending on the initial conditions, networks typically display multiple final dynamical states. The network's emergent dynamics is thus strongly dependent on the topology, and for a general network does not reach “minimum energy” state with zero frustration.

In a different context, researchers have been studying the problem of network design, motivated by the technological need to engineer networks that perform prescribed functions. Models are typically based on a network whose topology is evolving towards the optimal target topology. Most used among such models is the evolutionary optimisation, a version of Monte Carlo simulated annealing algorithm29. A myriad of results were obtained through this formalism, such as emphasising peculiarities of the scale-free topologies30, design of biological transduction networks31,32, design of robust genetic clocks33, or design of networks that optimally perform a given dynamical behaviour34. In the context of oscillators, design of easily synchronisable network was recently examined35, and a method of achieving the prescribed synchronisation state by configuring a repulsive subnetwork was exposed36.

A question that remains open in the context of phase-repulsive networks, regards the topologies that allow for the zero frustration state to be attained. These are the networks whose dynamics leads to anti-phase synchronisation for any choice of initial conditions. While essentially any oscillator network with phase-attractive coupling generates full synchrony, obtaining anti-phase synchronisation is more demanding. As shown in26, despite that phase-repulsive interactions naturally tend towards antiphase synchrony, a generic network typically can not attain fully anti-phase synchronised state due to the topological constraints. In this paper we employ the evolutionary design algorithm29,31,33, to obtain phase-repulsive oscillator networks that always achieve non-frustrated, i.e. anti-phase synchronised state. By choosing the links to rewire according to their frustration, the initial network topology evolves towards minimising global frustration, which inevitably leads to non-frustrated topology. As we show, in opposition to the well studied synchronisable networks35, whose synchronisation performance is typically enhanced by hierarchical or scale-free structures37, non-frustrated networks are topologically very uniform, and exhibit a precise scale38,39 rather than being scale-free. This problem is similar to the problem of 2-color vertex colouring encountered in graph theory40,41. The difference is that the process of vertex colouring is here automatically done by the network phase-repulsive dynamics.

We develop our model by considering a network that consists of N oscillators (nodes), connected via L non-directed links. Dynamical state of the oscillator i is given by the phase variable ϕi ∈ [0, 2π), and its dynamics is defined by:

graphic file with name srep00967-m1.jpg

where ki is the node's degree (Σiki = 2L), ε is the coupling strength, and ωi is the oscillator's natural frequency. Network's topology is expressed via symmetric adjacency matrix Aij, defined as Aij = 1 if nodes i and j are connected, and Aij = 0 otherwise. We consider identical oscillators ωi = ω, and set g = sin, reducing our system to the simple Kuramoto model8. Following the results exposed in26, we examine the network model with phase-repulsive coupling. To that end we fix ε = –1, and for simplicity take ω = 0. The equation for our model reads:

graphic file with name srep00967-m2.jpg

Time-evolution starts from a random set of initial phases (IP), selected independently for each oscillator from ϕi(0) ∈ [0, 2π). The interacting oscillator pairs evolve towards maximising the phase difference between them, i.e. their phase values “stretch” apart from each other as much as possible. Preferably, the maximal phase difference is π. However, for a general network, due to its complex topology, the phase difference along certain links is often less than π, or even zero. The final (stationary) dynamical state is quantified by introducing frustration fij for each link as26,27:

graphic file with name srep00967-m3.jpg

Frustration measures how “squeezed” is a link: it can be pictured as the elastic potential energy contained in it: a link stretched to the phase difference π has zero frustration, whereas a link forced to synchronise carries the maximal frustration that equals 2. We characterise the network dynamical states by specifying the link frustration values fij. To measure the global frustration we define F as the network average of f:

graphic file with name srep00967-m4.jpg

which quantifies how much does the network topology allow for links to stretch. Note that F can be seen as the non-equilibrium potential, since Eq.2 can be written as27:

graphic file with name srep00967-m5.jpg

As concluded in26, phase-repulsive dynamics for a general network leads to a positive total frustration, whose value strongly depends on the details of network topology. In widely studied phase-attractive case, full synchronisation is essentially the only final dynamical state, independently of the topology. In contrast, topology in our model crucially determines the dynamics. In addition, a general phase-repulsive network displays multiple final frustration states, each occurring for a certain fraction of IP.

Interestingly, some networks exhibit a unique dynamical state with zero total frustration F = 0. These networks are completely anti-phase synchronised – each coupled oscillator pair has the opposite phases for any IP. This comes from peculiar topologies of such networks that allow for all links to stretch, thus completely avoiding frustration. While in the phase-attractive case, basically any network achieves the fully synchronised state, in the phase-repulsive case only a limited set of networks attain the anti-phase synchronised state. In addition, such state is also stable, as it is the only possible dynamical equilibrium state. How can we construct non-frustrated networks? What are their topological properties? The rest of this paper is devoted to these two questions.

Results

We employ the evolutionary algorithm based on simulated annealing in order to design non-frustrated networks. The evolutionary process involves rewiring links with the probability proportional to their frustration fij, until a network with zero frustration along all links for all IP is obtained. Further details on our network design method are provided in Methods section below.

An example of a simple evolutionarily designed non-frustrated network with N = 20 nodes and L = 30 links is shown in Fig. 1. It was obtained after 15 evolution steps. The network appears to be uniform in structure, without prominent hubs. It is also bipartite, as illustrated by different shades of adjacent nodes. Large presence of 4-node rings, which are small non-frustrated networks, is clearly visible. There are also 6-node rings, which are unable to exhibit the higher F state due to being topologically intertwined with the rest of the network, which is forcing them into F = 0 state. Clustering coefficient is zero for all nodes. Due to a large number of 4-node rings, the network topology seems more regular than expected from an evolution governed by random rewirings.

Figure 1. Example of an evolutionarily designed non-frustrated network, with N = 20 nodes and L = 30 links.

Figure 1

Open in a new tab

All adjacent node pairs are having the opposite phase values (phase difference π), and hence zero frustration, for any choice of IP. Nodes appear in two shades in order to show bipartitness. Each node has zero clustering.

To quantify more precisely the topological properties of non-frustrated networks, we now consider larger networks with N = 100 nodes. We run evolution simulations with various numbers of links, ranging from L = 200 to L = 2000: all evolution processes yield a final non-frustrated network. In particular, we here focus on networks with L = 200, 400, 600 and 800, which are shown in Fig. 2, and indicated via the corresponding L (details on this evolution process are included in the Methods section below). As observed earlier with Fig. 1, the non-frustrated networks seem not to posses any hierarchical structure, which is even more apparent here. Of course, all the obtained networks are bipartite and have zero clustering. We run many evolution simulations with the same N and L: the same global topological features were always observed. As we show more quantitatively in what follows, the structures of these networks are indeed surprisingly regular.

Figure 2. Four networks with zero total frustration, obtained through evolutionary processes described in the Methods section, with N = 100 and L as indicated.

Figure 2

Open in a new tab

Again, networks attain anti-phase synchronisation for any choice of IP, are bipartite and have zero clustering. Networks of size beyond 800 are discussed in the Supplement figure.

We first compute the histograms of node degrees. To this end, we average the degree histograms over 5 realisations of the non-frustrated networks with given N and L, and report the results in Fig. 3. All histograms are very localised in range and display a well pronounced peak in the centre, whose value coincides with the average degree Inline graphic. As expected, for the increasing network size, the peak becomes gradually less pronounced. This confirms that our networks are not hierarchical. In order to nullify the frustration, network evolution leads towards evenly spreading the remaining link frustration over the network. This indicates that rather than being scale-free, non-frustrated networks are “scale-rich”, i.e. posses a well defined scale38 (this holds for small L, i.e. sparse networks). The scale is determined by the average node degree.

Figure 3. Histograms of node degrees for four non-frustrated networks with N = 100 and L as indicated, in correspondence with Fig. 2.

Figure 3

Open in a new tab

Data is averaged over 5 realisations of such networks. Each histogram displays a prominent peak, coinciding with the average node degree for each network.

The node degree histograms suggest that non-frustrated networks posses structures that are similar to Erdős-Rényi random networks, that the evolutionary process started from. However, two types of structure also have profound differences. Non-frustrated networks, by being bipartite, always have zero clustering. In contrast, the average expected clustering coefficient for random networks is Inline graphic1. This difference is a clearly pronounced in dense non-frustrated networks with high 〈ki〉. In addition, we found that non-frustrated networks systematically display somewhat longer average shortest paths than random networks with the same N and L. This can again be attributed to zero clustering: since no three nodes can be mutually interconnected, shortest paths are on average somewhat longer.

There is an upper bound on L for any given N, beyond which it is not possible to design non-frustrated networks, since avoiding connected node triangles becomes impossible. Close to this limit the network evolution process gradually becomes slower. The network structure however becomes even more regular, since avoiding frustration requires more and more ordered organisation of links, and more uniform node degrees. In the supplementary figure to this paper, we show the additional six networks with N = 100, and L ranging from 1000 to 2000. The regularity and bipartitness of these dense networks are clearly visible.

Finally, we quantity the topological regularity of non-frustrated networks. We achieve this by measuring the concentration of motifs in our networks, using the mfinder software42. We first introduce Zscore, as a measure of how over- or under- represented is a given motif w within some network. It is defined as43:

graphic file with name srep00967-m6.jpg

where Nactual(w) is the number of motifs w found in the examined network, Nrandom(w) is the average expected number of those motifs in a network with the same N and L, while SD(w) is the standard deviation of Nrandom(w). Thus, any motif whose Zscore is considerably bigger (smaller) than 1 (−1) is over- (under-) represented. Since the studied networks differ in their numbers of links, rather them employing Zscore, we instead rely on normalised Zscore, which is defined as32:

graphic file with name srep00967-m7.jpg

We calculate Znormalised for all 4-node non-directed motifs (shown in Fig. 5c), for four evolutionarily designed networks shown in Fig. 2. The results are reported in Fig. 4. In all networks, non-frustrated motifs are overwhelmingly over-represented, while the frustrated motifs are drastically under-represented (cf. Fig. 5). Both over- and under- representation are invariant to varying realisations of non-frustrated networks, and to the number of links L. The same result is found for both 3-node motifs: the chain is systematically over-represented, while the ring is strongly under-represented. This suggests that, regardless of their size, non-frustrated networks have an inherent motif pattern, rooted in their dynamical properties. This result confirms that large non-frustrated networks are essentially composed of small non-frustrated motifs. By locally forming non-frustrated motifs, mechanism of network evolution evolves towards global zero frustration. Interestingly, this means that the emergence of global F = 0 is achieved locally, by each network building block evolving towards F = 0. This implies that any large non-frustrated network can be decomposed into smaller non-frustrated subnetworks (an alternative scenario can be imagined, where the desired global property is achieved only globally, i.e. only at the level of the entire network, with no subnetworks exhibiting the same property).

Figure 5. Frustration for two-node network in (a), both three-node networks in (b), and all six possible four-node networks in (c).

Figure 5

Open in a new tab

Total frustration F is reported, along with all link frustrations Inline graphic, illustrated by the (color)scale. Frustration is defined in Eq.3 and Eq.4, and refers to the dynamical model Eq.2. Note that three four-node networks are frustrated, and the other three are not.

Figure 4. The value of Znormalised for all non-directed 4-node motifs in the networks considered in Fig. 2 as indicated, computed using mfinder software42.

Figure 4

Open in a new tab

Non-frustrated motifs are over-represented, while the frustrated motifs are under-represented. Profiles are invariant to the network size.

Discussion

Natural evolutionary processes in real complex networks often lead to scale-free structures in the emerging networks30. However, the ubiquity of scale-free topologies has been recently challenged. New findings include examples of real complex networks, that despite emerging from biological self-organisation, posses a clear scale in their structure, contrasting widely accepted universality of scale-free topologies38,39. In this paper, we showed a model of network topology that develops under a simple evolutionary constraint, whose topology evolves away from hierarchical structure, and towards a “scale-rich” structure38. As shown above, this can be attributed to the nature of phase-repulsive dynamics, which requires certain topological properties in order to attain fully anti-phase synchronised state (i.e., non-frustrated state). Hence, in opposition to the phase-attractive dynamics and resulting full synchronisation, that are typically improved by the presence of a topological hierarchy, anti-phase synchronisation appears to be enhanced by the lack of hierarchy.

Bipartite networks are usually considered in relation to two different types of nodes, such as on-line comments and the corresponding web-page users (persons)44. Here we showed that bipartitness can spontaneously emerge from the evolution of a network with a single type of nodes (identical oscillators). Besides these findings, this work confirmed again that evolutionary design through random link rewirings is a viable method of constructing complex networks that exhibit prescribed dynamical patterns. Our method mimics the natural evolutionary processes, by implementing random mutations (rewirings). To make mutations completely random, one could modify the algorithm to choose links for rewiring regardless of their frustration. This would however only slow down the process, without changing the final result. On the other hand, it is possible that the non-frustrated networks can be obtained by means of other design methods. Such methods are however still poorly explored, even in the context of simple models such as oscillator networks.

We conclude this section by examining the limitations and extensions of our results. As noted earlier, zero frustration is not achievable beyond a certain limit of L. Our algorithm can in this case be applied to minimising the frustration, and studying the ways in which the resulting networks organise the remaining frustrated links. Another question refers to maximising instead of minimising the total network frustration. By accepting the mutations that increase rather than decrease F, our algorithm can be used to design networks with maximal obtainable frustration. Intriguing problem here is the difference between the frustrated (squeezed) and non-frustrated (relaxed) network topologies. This is related to elastic network models, where mechanical properties of networks of elastic springs are studied45. It would be also interesting to apply the same algorithm to design non-frustrated networks using other models of repulsive interactions. This particularly refers to neural and gene interactions, where networks with repressive interactions are widely studied17,18,20. This could aid engineering genetic or neural networks with a given prescribed functionality. Finally, we note that our networks were designed to satisfy a simple dynamical rule, formulated as F = 0. By varying the dynamical rules, one could use this or similar algorithms to design networks whose topological properties reflect a predetermined dynamical rule. This could lead to the discovery of new complex network topologies, that do not fit into any of the currently studied topological categories.

Methods

In this section we describe our method of evolutionarily network design and explain its implementation.

Preliminaries

For small networks it is easy to find non-frustrated topologies, as shown in Fig. 5. A connected pair of nodes, 3-node chain, 4-node star, 4-node chain and 4-node ring (cycle), are networks that show a single frustration state F = 0. However, finding a large non-frustrated network of size Inline graphic, is not straightforward. A typical network will in general have F > 0, for instance, due to having at least one 3-node ring. On the other hand, it is easy to notice that for a network to be non-frustrated, it needs to be bipartite, and hence have zero clustering. Indeed, for having two groups of nodes with opposite phases, the network needs to involve links that exclusively go from nodes of one group to the nodes of the other group. However, although necessary for anti-phase synchronisation, bipartitness is not sufficient for it. In Fig. 6 we show the 6-node ring, which is a bipartite network. However, besides displaying the expected non-frustrated state, the network possesses another frustrated state with F = 0.5, that occurs for 14% of IP. Bipartitness alone guarantees the existence of a non-frustrated state, but it does not guarantee its uniqueness. This indicates that we need a more elaborated mechanism for designing non-frustrated networks with the unique F = 0 state.

Figure 6. Two frustration states exhibited by the 6-ring.

Figure 6

Open in a new tab

Total frustration F and the link frustrations Inline graphic are shown for each state. The non-frustrated and the frustrated states appear for 86% and 14% of IP, respectively.

Evolutionary algorithm

We employ the simulated annealing algorithm as follows. Starting from a random network, at each evolution step we rewire one of the frustrated links, and accept the mutation if the new network exhibits smaller total frustration F than the original one. The network topology evolves until the target F = 0 is reached. More precisely, our algorithm goes as follows:

0. Start from a non-directed, connected network Inline graphic, with N nodes and L links Inline graphic, and no self-loops. We use Erdős-Rényi random network. Compute link frustration values Inline graphic and total frustration Inline graphic, averaged over M random IP. We use M = 5.

1. Select a link ij in Inline graphic with probability proportional to Inline graphic (we use α = 0.01). Detach this link from one of its end-nodes (randomly chosen), and rewire it to a different node chosen with uniform probability, making sure that the network stays connected and without self-loops. This is the mutated network Inline graphic.

2. For Inline graphic compute Inline graphic and Inline graphic. If Inline graphic the mutation is accepted, and the network is updated: Inline graphic. If Inline graphic the mutation is accepted with probability Inline graphic. Otherwise, the mutation is rejected and Inline graphic remains unchanged. We use σ = 0.02.

3. The process continues from step 1 by selecting a new link in Inline graphic to be rewired.

The evolution continues until the final network Inline graphic with a unique frustration state F = 0 is reached. Potential multiple frustration states are excluded by averaging over M random IP. The numerical constant α skews the probability distribution allowing for non-frustrated links to be mutated as well, while ensuring that more frustrated links are still mutated more often. This drastically expedites the evolution process, while at the same time allowing for all links to be mutated. Parameter σ allows that, with a small probability, even mutations leading to a small increase of total frustration get accepted. By playing the role of temperature, σ prevents the evolution process from getting stuck into local minima.

Algorithm's performance

We tested the evolution algorithm exposed above on numerous network examples: the process invariably leads to a non-frustrated network. Since the evolution involves randomness, the final network does not depend on the starting one. On the other hand, for any fixed N and L there are many different realisations of final non-frustrated networks, all sharing the key topological properties. To illustrate the progress of the network evolution, we show in Fig. 7 the gradual decrease of Inline graphic for four examples of evolution simulations related to networks from Fig. 2. The evolution speed decreases with the increase of L. In a denser network it is harder to find a mutation that leads to a decrease of Inline graphic, and when found, that mutation typically decreases Inline graphic for a small amount. In addition, denser networks start with a larger initial Inline graphic, thus additionally increasing the needed number of evolution steps. We adjusted for the optimality of the process through the parameters M, α and σ. The “bumpiness” of the processes is due to Monte Carlo algorithm's temperature σ > 0. This parameter needs to be adequately set to optimise the evolution speed and effectiveness. Too small σ might result in process getting suck into a local minimum of Inline graphic, which may incorrectly suggest that smaller Inline graphic is not obtainable. Too large σ could induce the process to wander too excessively, without ever finding Inline graphic solution. Our choice of σ = 0.02 takes into account both issues. At each evolutionary iteration, the network usually has multiple frustration states with different F-values. To obtain a single frustration value Inline graphic corresponding to the current network, we average F-values over M = 5 IP. This is an additional reason for introducing temperature σ: due to a potentially wide range of multiple states, averaging might not give the best measure of the total frustration. Upon each completion of evolutionary simulation, we checked that the obtained network is indeed non-frustrated.

Figure 7. Network evolution processes generating four networks considered in Fig. 2.

Figure 7

Open in a new tab

The value of total frustration averaged over M = 5 IP Inline graphic is shown, as function of the number of evolution steps.

Supplementary Material

Supplementary Information

Supplementary figure

srep00967-s1.pdf (545.5KB, pdf)

Acknowledgments

Thanks to Alexander Mikhailov for useful suggestions, and Uri Alon for making mfinder publicly available.

Footnotes

The author declares no competing financial interests.

References

  1. Dorogovtsev S. N. Lectures on Complex Networks. Oxford University Press, Oxford, (2010). [Google Scholar]
  2. Costa L. F. et al. Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv. Phys. 60, 329–412 (2011). [Google Scholar]
  3. Levnajić Z. & Tadić B. Stability and chaos in coupled two-dimensional maps on gene regulatory network of bacterium E. coli. Chaos 20, 033115 (2010). [DOI] [PubMed] [Google Scholar]
  4. Fortunato S. Community detection in graphs. Phys. Rep. 486, 75–174 (2010). [Google Scholar]
  5. Pikovsky A., Rosenblum M. & Kurths J. Synchronization. A Universal Concept in Nonlinear Sciences. Cambridge University Press, Cambridge, (2003). [Google Scholar]
  6. Arenas A. et al. Synchronization in complex networks. Phys. Rep. 469, 93 (2008). [Google Scholar]
  7. Ravoori B. et al. Robustness of Optimal Synchronization in Real Networks. Phys. Rev. Lett. 107, 034102 (2011). [DOI] [PubMed] [Google Scholar]
  8. Kuramoto Y. Chemical Oscillations, Waves, and Turbulence. Dover, New York, (2003). [Google Scholar]
  9. Acebrón J. A. et al. Kuramoto model: A simple paradigm for synchronization phenomena. Rev. Mod. Phys. 77, 137–185 (2005). [Google Scholar]
  10. Levnajić Z. & Pikovsky A. Network Reconstruction from Random Phase Resetting. Phys. Rev. Lett. 107, 034101 (2011). [DOI] [PubMed] [Google Scholar]
  11. Perez Velazquez J. L. et al. Phase response curves in the characterization of epileptiform activity. Phys. Rev. E 76, 061912 (2007). [DOI] [PubMed] [Google Scholar]
  12. Kim C. M. et al. Anti-synchronization of chaotic oscillators. Phys. Lett. A 320, 39–46 (2003). [Google Scholar]
  13. Liu W., Xiao J., Qian X. & Yang J. Antiphase synchronization in coupled chaotic oscillators. Phys. Rev. E 73, 057203 (2006). [DOI] [PubMed] [Google Scholar]
  14. Elowitz M. B. & Leibler S. A synthetic oscillatory network of transcriptional regulators. Nature 403, 335 (2000). [DOI] [PubMed] [Google Scholar]
  15. Gardner T. S., Cantor C. R. & Collins J. J. Construction of a genetic toggle switch in Escherichia coli. Nature 403, 339 (2000). [DOI] [PubMed] [Google Scholar]
  16. Hast J., McMillen D. & Collins J. J. Engineered gene circuits. Nature 420, 2244 (2002). [DOI] [PubMed] [Google Scholar]
  17. Jensen M. H., Krishna S. & Pigolotti S. Repressor Lattice: Feedback, Commensurability, and Dynamical Frustration. Phys. Rev. Lett. 103, 118101 (2009). [DOI] [PubMed] [Google Scholar]
  18. Koseska A. et al. Inherent multistability in arrays of autoinducer coupled genetic oscillators. Phys. Rev. E 75, 031916 (2007). [DOI] [PubMed] [Google Scholar]
  19. Wang Q., Perc M., Duan Z. & Chen G. Synchronization transitions on scale-free neuronal networks due to finite information transmission delays. Phys. Rev. E 80, 026206 (2009). [DOI] [PubMed] [Google Scholar]
  20. Wang Q., Chen G. & Perc M. Synchronous bursts on scale-free neuronal networks with attractive and repulsive coupling. PLoS ONE 6, e15851 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  21. Balázsi G. et al. Synchronization of hyperexcitable systems with phase-repulsive coupling. Phys. Rev. E 64, 041912 (2001). [DOI] [PubMed] [Google Scholar]
  22. Balázsi G., Cornell-Bell A. H. & Moss F. Increased phase synchronization of spontaneous calcium oscillations in epileptic human versus normal rat astrocyte cultures. Chaos 13, 515 (2003). [DOI] [PubMed] [Google Scholar]
  23. Marvel S. A., Strogatz S. H. & Kleinberg J. M. Energy landscape of social balance. Phys. Rev. Lett. 103, 198701 (2009). [DOI] [PubMed] [Google Scholar]
  24. Hong H. & Strogatz S. H. Kuramoto Model of Coupled Oscillators with Positive and Negative Coupling Parameters: An Example of Conformist and Contrarian Oscillators. Phys. Rev. Lett. 106, 054102 (2011). [DOI] [PubMed] [Google Scholar]
  25. Louzada V. H. P. et al. How to suppress undesired synchronization. Sci. Rep. 2, 658 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  26. Levnajić Z. Emergent multistability and frustration in phase-repulsive networks of oscillators. Phys. Rev. E 84, 016231 (2011). [DOI] [PubMed] [Google Scholar]
  27. Zanette D. H. Synchronization and frustration in oscillator networks with attractive and repulsive interactions. Europhys. Lett. 72, 190 (2005). [Google Scholar]
  28. Mezard M., Parisi G. & Virasoro M. Spin Glass Theory and Beyond, World Scientific., Singapore, 1987.
  29. Bornholdt S. & Sneppen K. Robustness as an Evolutionary Principle. Proc. R. Soc. Lond. B 267, 2281–2286 (2000). [DOI] [PMC free article] [PubMed] [Google Scholar]
  30. Oikonomou P. & Cluzel P. Effects of topology on network evolution. Nat. Phys. 2, 532–536 (2006). [Google Scholar]
  31. Kaluza P. et al. Design and statistical properties of robust functional networks: A model study of biological signal transduction. Phys. Rev. E 75, 015101(R) (2007). [DOI] [PubMed] [Google Scholar]
  32. Kaluza P., Vingron M. & Mikhailov A. S. Self-correcting networks: Function, robustness, and motif distributions in biological signal processing. Chaos 18, 026113 (2008). [DOI] [PubMed] [Google Scholar]
  33. Kobayashi Y. et al. Robust network clocks: Design of genetic oscillators as a complex combinatorial optimization problem. Phys. Rev. E 83, 060901(R) (2011). [DOI] [PubMed] [Google Scholar]
  34. Karalus S. & Porto M. Network evolution towards optimal dynamical performance. Europhys. Lett. 99, 38002 (2012). [Google Scholar]
  35. Yanagita T. & Mikhailov A. S. Design of easily synchronizable oscillator networks using the Monte Carlo optimization method. Phys. Rev. E 81, 065204 (2010). [DOI] [PubMed] [Google Scholar]
  36. Arizmendi F. & Zanette D. H. Adaptation to synchronization in phase-oscillator networks. Physica A 387, 5631 (2008). [Google Scholar]
  37. Motter A. E., Zhou C. & Kurths J. Network synchronization, diffusion, and the paradox of heterogeneity. Phys. Rev. E 71, 016116 (2005). [DOI] [PubMed] [Google Scholar]
  38. Tanaka R. Scale-rich metabolic networks. Phys. Rev. Lett. 94, 168101 (2005). [DOI] [PubMed] [Google Scholar]
  39. Pržulj N. Protein-protein interactions: making sense of networks via graph-theoretic modeling. Bioessays 33, 2 (2011). [DOI] [PubMed] [Google Scholar]
  40. Dvořák Z., Král D. & Škrekovski R. Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory 63, 129–145 (2010). [Google Scholar]
  41. Diestel R. Graph Theory., Springer, 2010.
  42. Software package mfinder is available at http://www.weizmann.ac.il/mcb/UriAlon/ (Accessed Dec. 4, 2012).
  43. Milo R. et al. Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 824–827 (2002). [DOI] [PubMed] [Google Scholar]
  44. Mitrović M., Paltoglou G. & Tadić B. Networks and emotion-driven user communities at popular blogs. Eur. Phys. J. B 77, 597–609 (2010). [Google Scholar]
  45. Flechsig H. & Mikhailov A. S. Tracing entire operation cycles of molecular motor hepatitis C virus helicase in structurally resolved dynamical simulations. Proc. Nat. Acad. Sci. USA 107, 20875 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supplementary Information

Supplementary figure

srep00967-s1.pdf (545.5KB, pdf)

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES