Topologically protected synchronization in networks
Abstract
In a graph, we say that two nodes are topologically equivalent if their sets of first neighbors, excluding the two nodes, coincide. We prove that nonlinearly coupled oscillators located on a group of topologically equivalent nodes can get easily synchronized when the group forms a fully connected subgraph (or combinations of these), regardless of the status of all the other oscillators. More generally, any change occurring in the inner part of the remainder of the graph will not alter the synchronization status of the group. Typically, the group can synchronize when , and being the common internal and outgoing degree of each node in the group, respectively. Simulations confirm our analysis and suggest that groups of topologically equivalent nodes play the role of independent pacemakers.
Many physical, biological, chemical, and technological systems can effectively be seen as networks of interacting oscillators, each with its own natural frequency. Two oscillators are considered neighbors if they are coupled by some nonlinear function of their phase difference. Spontaneous synchronization represents one of the most intriguing and ubiquitous aspects of these systems StrogatzC ; Pikovsky ; ArenasReview and has countless applications such as, pacemaker cells in the heart Heart , pacemaker cells in the brain Brain , flashing fireflies Fireflies , arrays of lasers Lasers , and superconducting Josephson junctions Josephson . Put simply, if the coupling constant is larger than the spread of the natural frequency distribution in the system, a finite portion of its oscillators tends to synchronize, i.e., they tend to rotate according to a common mean frequency and their phases fall into step with one another (locked in phase). Kuramoto-like models, where the coupling between two oscillators is modulated by the sine of their phase difference, provide the most popular approach for addressing synchronization in complex systems. In its mean-field version, where each oscillator is coupled to all other oscillators, the model allows to be exactly solved Strogatz2000 while, in the general case, despite no exact solution is known, rigorous bounds Strogatz1988 , large scale simulations and theoretical studies ArenasReview ; Munoz ; Kahng have succeeded to provide a general description of the different synchronization scenarios that can take place as a function of the topology of the underlying graph Goltsev , ranging from regular to random, small-world, and even scale-free. For the present manuscript, we emphasize the role played by modularity. Many complex networks are modular, i.e., can be seen as subgraphs (also known as groups or communities) with different internal and external connectivities Barabasi_Hierarchical ; Santo . It has been understood that, in modular networks, the densely connected communities synchronize first, and subsequently, the larger and less densely connected ones also tend to synchronize until full synchronization is achieved ArenasPRL ; ArenasReview .
Most of the above literature analyzes synchronization in the thermodynamic limit, viewed as a phase transition characterized by an emergent phase diagram containing essentially an incoherent region (where most of the oscillators follow their own natural frequencies) and a coherent one (where most of the oscillators get locked within each other). Here, we consider a rather different issue related to a local and protected synchronization: “local” because it concerns a finite group of oscillators embedded in some arbitrary graph containing the group; “protected” because the remainder of the graph cannot affect the synchronization status of the group, even when the former is subject to noise. Formally, our work belongs to what is known as synchronization of chaotic systems via bidirectional coupling Boccaletti , a branch less developed than the unidirectional case (or “slave-master” Note ) Boccaletti2 ; Topological_Non_Hermitian . At any rate, to the best of our knowledge, our analysis and findings — based on topological equivalence combined with modularity — have never been reported. In recent years, topology has been shown to play a major role in many areas of physics, ranging from topological insulators Topological_Insulator to quantum computation Topological_Quantum_Computing ; in this sense, synchronization cannot be an exception. We stress however that, despite a reminiscent terminology, our definition of topologically equivalent (TE) nodes is quite unrelated to these works.
Given a graph with nodes and symmetric adjacency matrix , consider a Kuramoto-like model on the top it, where the phases of oscillators, , with natural frequencies , evolve according to
(1) |
being a coupling constant.
Group of TE nodes. Consider now two specific nodes, say node 1 and node 2 (note that ). From now on, unless otherwise stated, we assume that the two nodes are connected: . For the phase difference variable , Eqs. (1) lead to
(2) |
where we have introduced the two functions
(3) |
Let us now suppose that node 1 and node 2 “see” the same remaining graph, i.e., i.e.,
(4) |
We shall say that the two nodes are TE. In this case
(5) |
and Eq. (2) becomes
(6) |
We can rewrite Eq. (6) as
(7) |
where and we have applied the mean-value theorem to the function . Note that is itself an unknown function of and (or, alternatively, and ), yet, as we shall see in a moment, it is worth to consider Eq. (7). We will use the following bounds:
(8) |
where is the (common) outgoing degree of the two nodes
(9) |
and
(10) |
where
(11) |
Equal frequencies with . Let us assume that the two nodes have also equal natural frequencies, . From Eq. (7) we see that, in the manifold (), the two external fields cancel out, in other words, provides a fixed point of the equation. Let us introduce and . From Eq. (7), by using the bounds (8) and (10), we see that, if ,
(12) |
while, if , hold the opposite inequalities. Let us assume that, for the initial condition , we have . By continuity, there exists a sufficiently small time such that for whereby, from Eq. (12),
(13) |
On the other hand, if , Eq. (13) and the fact that each (an hence also ) as well as are continuous, imply that , so that Eq. (13) holds for any SM . For simplicity, in the subsequent cases, on assuming certain constrains on the initial conditions, we shall limit ourselves to check that the upper bounding solution satisfies the same constrains for any . Note however that, in general, simply bounding is not enough for claiming good synchronization; the conservation of the sign of is crucial.
In conclusion, within a basin of attraction for the initial conditions contained in the region , a sufficient condition for the fixed point to be stable is . Of course, since and is integer, it follows that can be either 0 or 1, but, in view of generalizations to subsystems with TE oscillators, it is useful to keep in mind the inequality. Note that this synchronization between node 1 and node 2 occurs regardless of the dynamics of all the other oscillators, which in particular do not need to be synchronized. Note also that we have imposed only the equality of the frequencies of the two nodes, but the other nodes can have arbitrary frequencies and the result does not change. We stress that this is a consequence of the topological equivalence (4); when (4) does not hold, and remain two different functions so that, in the manifold , they do not cancel out in Eq. (2). We can even imaging to modify the inner part of the remainder of the graph by dynamically removing, adding, or rewiring some of its links, as well as by allowing for the presence of any site-dependent noise: as far as such links are not those arriving at nodes 1 and 2, and as far as such noise applies only to the other nodes, the sufficient condition remains satisfied, i.e., the subsystem fixed point keeps being stable.
Equal frequencies with . Before analyzing the most general case, it is worth also considering the sub-case in which the two nodes are disconnected,i.e., and have equal frequencies. In this case, the evolution equation for is of no help because is no longer a stable attractor, in other words, in general, they do not get synchronized. However, from Eq. (1) we see that, if nodes 1 and 2 are TE, and obey the same identical equation: we simply have that one oscillator follows the other along the same identical trajectory and, in particular, if they started with the same initial condition, they will remain identical at any instant. In this specific case, is no longer an attractor but rather a constant of the motion.
Different frequencies with . Let us now allow for the two frequencies to be different. If the pair is isolated, i.e., , we have and Eq. (7) returns the known critical condition for the synchronization of oscillators: , the stability condition of the fixed point being . In the general case, , we must observe that, although Eq. (7) admits (under suitable conditions) a formal fixed point, due to the fact that depends on (besides ), such a fixed point is conditioned on the value of , which in turn is a function of time, rendering this formal fixed point useless. Our approach here is different: we assume that both and the initial condition are sufficiently small and look for a bounding solution by exploiting again the bounds (8) and (10). Let us suppose and . By continuity, at small enough times, we also have and from Eq. (7) we get
(14) |
Equation (14) implies that, if , then , with initial condition , will remain bounded as follows
(15) |
Note that, for , all the above procedure turns out to be consistent with the required bound for any .
In conclusion, we have proven that, under the three conditions (equivalent to ), , and , we have when . In other words, the phases of the two oscillators get asymptotically close to each other and the larger is the closer they stay. Moreover, as in the case of equal frequencies, we see that this bound holds regardless of the status of all the other oscillators located on the remainder of the graph and, again, any change in it, cannot affect the synchronization of the pair.
It is important to note that the nature of the condition , unlike the others related to the initial value of and to the ratio , is strictly topological. We shall call it the topological condition (TC).
Generalization to TE oscillators. Let us now consider a subsystem of TE nodes, say nodes 1, 2 and 3. Besides being TE with respect to the remainder of the graph, we want them to be TE among each other; in particular, each of them must have the same number of links pointing to the other two TE nodes. For there exists only one possibility, the one where , i.e., the three nodes form a triangle. Here we have introduced as the internal (common) connectivity of the group, i.e., is the number of links emanating from a node of the group and pointing to other nodes of the same group. Note that, formally, both the subsystem and the one already seen case (where it was ), are fully connected (FC) graphs with nodes. However, as Fig. 1 shows, when , there exist more configurations in which the TE nodes can be arranged. In fact, the number of possible arrangements tends to grow exponentially with , but with a smaller rate for odd (see also SM ).

We introduce some notation and point out a few crucial points. Given TE nodes with indices , we indicate their corresponding phase differences by and frequency differences by . Observe that and that the variables with , are not all independent. For example, for we have the constrain . In general, given , we can always write a system of independent equations involving independent variables. We shall also assume so that, at small enough times, we also have . Our general strategy is to use the bounds (8), (10); if the found bounding solution keeps satisfying the above constrains for any time , the procedure is consistent. The resulting bounding system can be written vectorially:
(16) |
where , , and is a matrix that depends on the parameters , , , and . Let and be the eigenvalues and normalized eigenvectors of , respectively. The coefficients satisfy the decoupled system . As a consequence, each component of the vector remains bounded if all the eigenvalues of are negative, leading to the TC (note that the eigenvalues do not depend on or ). For example, in the FC case we have
(17) |
and the eigenvalues of are and . We conclude that the group of TE FC nodes synchronize if , which, on observing that , amounts to , or , where we have made use of the fact that, here, . Note that also for the previously seen case , where it was , the TC for the synchronization can be written as . In general, for a group of TE nodes FC, the diagonal elements of the matrix are all equal to , while the off-diagonal ones are in the form where . We have verified that for the TC remains but for the TC becomes . For details see SM where we also analyze cases where the group forms regular polygons. We stress that these are sufficient conditions; they might be not necessary.

We illustrate our analysis by solving numerically Numerical_Recipes model (1) in a system of moderate size but involving most of the ideas so far discussed. The graph associated to this system is depicted in Fig. 1. It contains five groups of TE nodes of various kind for which the TC is satisfied. We performed several simulations with different choices of the parameters and ranging from situations in which the sufficient conditions for synchronization discussed previously are strictly satisfied, to situations in which only the TC is satisfied. Remarkably, even in these latter situations, the synchronization scenario predicted analytically (via stricter conditions) holds. Figs. 2 and 3 show the behavior of in the two situations. Inset of Fig. 3 shows also the rotating numbers . For more details see SM .

In conclusion, simulations confirm the local synchronization scenario predicted analytically and extend its region of validity for a quite wider range of initial conditions and spread of natural frequencies: groups of TE nodes with sufficiently smaller than (depending on the specific group), synchronize and remain protected from the remainder of the system, which could be even noisy. Moreover, the plots of the rotating numbers strengthen the idea that these groups of TE nodes play the role of independent pacemakers of the system. In fact, in these plots, the number of lines of convergence seems to scale as the number of TE groups. As the coupling increases, these lines approach each other and eventually converge to a unique line establishing global synchronization, consistently with ArenasPRL ; Note2 . However, for any finite value of , each group keeps its own synchronization status, regardless of the others; this fact seems to hinder global synchronization while allowing for the local one. Of course, this hypothesis needs to be tested in larger systems. Many other questions arise, particularly the following: i) Do real-world networks contain groups of TE nodes? ii) Do real-world networks exist where the number of different groups, say , scales with the system size ? iii) Is it possible to probe efficiently very large systems to quantify as well as to identify the nodes of these groups? We anticipate that these three questions meet a positive answer and will be the subject of a subsequent publication.
References
- (1) S. H. Strogatz, Nonlinear Dynamics and Chaos, with Applications to Physics, Biology, Chemistry, and Engineering, (Addison-Wesley 1994).
- (2) A. Pikovsky, M. Rosenblum, and J. Kurths, Synchronization, A Universal Concept in Nonlinear Sciences, (Cambridge, 2001).
- (3) A. Arenas, A. Díaz-Guilera, J. Kurths, Y. Moreno, C. Zhou, Synchronization in complex networks, Physics Reports 469 93 (2008).
- (4) A. Zaza and G. Mazzoccoli, Cardiac Pacemaker Cells: Physiology and Clinical Implications, J. of Cardiovascular Medicine, 14, 449 (2013).
- (5) M. H. Hastings, J. H. Meijer, D. M. Ground, A Genetic Approach to the Mechanism of Circadian Pacemaking, J. of Biological Rhythms, 18(5), 343-353 (2003).
- (6) J. R. Knight, Synchronized Flashing in Fireflies: A Review, Lumie’re Magazine, 59, 322 (2006).
- (7) S. Yu. Kourtchatov, V.V. Likhanskii, A.P. Napartovich, F.T. Arecchi, A. Lapucci, Theory of phase locking of globally coupled laser arrays, Phys. Rev. A 52 4089 (1995).
- (8) K. Wiesenfeld, P. Colet, S.H. Strogatz, Frequency locking in Josephson arrays: Connection with the Kuramoto model, Phys. Rev. E 57 1563 (1998).
- (9) S. H. Strogatz, From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators, Physica D 143 1 (2000).
- (10) S.H. Strogatz, R.E. Mirollo, Phase-locking and critical phenomena in lattices of coupled nonlinear oscillators with random intrinsic frequencies, Physica D 31 143 (1988).
- (11) L. Donetti, F. Neri and Miguel A Muoz, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, J. Stat. Mech. P08007 (2006).
- (12) E. Oh, K. Rho, H. Hong, and B. Kahng, Modular synchronization in complex networks, Phys. Rev. E 72, 047101 (2005).
- (13) S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, Critical phenomena in complex networks, Rev. Mod. Phys. 80, 1275 (2008).
- (14) E. Ravasz and A.-L. Barabási, Hierarchical organization in complex networks, Phys. Rev. E 67, 026112 (2003).
- (15) S. Fortunato, Community detection in graphs, Phys. Rep. 486, 75 (2010).
- (16) A. Arenas, A. Díaz-Guilera, C. J. Pérez-Vicente, Synchronization Reveals Topological Scales in Complex Networks, Phys. Rev. Lett. 96 114102 (2006).
- (17) S. Boccaletti, J. Kurths, G. Osipov, D.L. Valladares, C.S. Zhou, The synchronization of chaotic systems, Physics Reports 366 1 (2002).
- (18) Within quantum mechanics this amounts to non-hermicity.
- (19) N. Lahav, I. Sendia-Nadal, C. Hens, B. Ksherim, B. Barzel, R. Cohen, S. Boccaletti, Topological synchronization of chaotic systems, Scientific Reports 12 2508 (2022).
- (20) K. Sone, Y. Ashida, T. Sagawa, Topological synchronization of coupled nonlinear oscillators, Phys. Rev. Research 4, 023211 (2022).
- (21) Xiao-Liang Qi and Shou-Cheng Zhang, Topological insulators and superconductors, Rev. Mod. Phys. 83, 1057 (2011).
- (22) L. Hormozi, G. Zikos, N. E. Bonesteel, S. H. Simon, Topological Quantum Compiling, Phys. Rev. B. 75 165310 (2007).
- (23) W. H. Press, S. A. Teukolsky, W. T. Vetterling, and Brian P. Flannery, Numerical Recipes-The Art of Scientific Computing, Third Edition, (Cambridge, 2007).
- (24) Supplemental material.
- (25) We observe that the hierarchical graph of Ref. Barabasi_Hierarchical used in Ref. ArenasPRL to study how modularity affects synchronization, does contain groups of TE nodes (corresponding to the boundaries of the squares of that graph with ), although arranged in a very peculiar way.