Topologically protected synchronization in networks
Massimo Ostilli
TL;DR
The paper introduces topologically equivalent (TE) groups in Kuramoto networks and proves that a TE group forming a fully connected subgraph can synchronize with the rest of the network acting as a noninfluential background, provided the topological condition k^{(OUT)} ≤ k^{(IN)} holds. It derives rigorous bounds on phase differences using a bounding ODE \dot{Θ} ≤ Ω + J B Θ, showing that all eigenvalues of B must be negative (the TC) for protection of synchronization, and explicitly solves the cases N' = 2, 3, 4, 5 FC to obtain precise TC inequalities. The work generalizes to arbitrary N' TE nodes and discusses other topologies (disconnected unions, regular polygons), identifying how TC depends on internal and external degrees and illustrating the phenomenon with simulations that reveal TE groups behaving as independent pacemakers. This mechanism offers a robust, topology-driven route to localized synchronization in heterogeneous oscillator networks, with potential implications for biological and engineered systems.
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 heterogeneous oscillators located on a group of topologically equivalent nodes can get easily synchronized when the group forms a fully connected subgraph (or combinations thereof), regardless of the status of all the other oscillators. More generally, any change occurring in the remainder of the graph will not alter the synchronization status of the group. Typically, the group can synchronize when $k^{(\mathrm{OUT})}\leq k^{(\mathrm{IN})}$, $k^{(\mathrm{IN})}$ and $k^{(\mathrm{OUT})}$ being the common internal and outgoing degree of each node in the group, respectively. Simulations confirm our rigorous analysis and suggest that groups of topologically equivalent nodes act as independent pacemakers.
