1 March 2016 in Journal of Mathematical Physics
Determining the number of stable phase-locked solutions for locally coupled Kuramoto models is a long-standing mathematical problem with important implications in biology, condensed matter physics, and electrical engineering among others. We investigate Kuramoto models on networks with various topologies and show that different phase-locked solutions are related to one another by loop currents. The latter take only discrete values, as they are characterized by topological winding numbers. This result is generically valid for any network and also applies beyond the Kuramoto model, as long as the coupling between oscillators is antisymmetric in the oscillators’ coordinates. Motivated by these results, we further investigate loop currents in Kuramoto-like models. We consider loop currents in nonoriented n-node cycle networks with nearest-neighbor coupling. Amplifying on earlier works, we give an algebraic upper bound for the number of different, linearly stable phase-locked solutions. We show that the number of different stable solutions monotonically decreases as the coupling strength is decreased. Furthermore stable solutions with a single angle difference exceeding π/2 emerge as the coupling constant K is reduced, as smooth continuations of solutions with all angle differences smaller than π/2 at higher K. In a cycle network with nearest-neighbor coupling, we further show that phase-locked solutions with two or more angle differences larger than π/2 are all linearly unstable. We point out similarities between loop currents and vortices in superfluids and superconductors as well as persistent currents in superconducting rings and two-dimensional Josephson junction arrays.
1 October 2017 in Chaos: An Interdisciplinary Journal of Nonlinear Science
In dynamical systems, the full stability of fixed point solutions is determined by their basins of attraction. Characterizing the structure of these basins is, in general, a complicated task, especially in high dimensionality. Recent works have advocated to quantify the non-linear stability of fixed points of dynamical systems through the relative volumes of the associated basins of attraction [Wiley et al., Chaos 16, 015103 (2006) and Menck et al. Nat. Phys. 9, 89 (2013)]. Here, we revisit this issue and propose an efficient numerical method to estimate these volumes. The algorithm first identifies stable fixed points. Second, a set of initial conditions is considered that are randomly distributed at the surface of hypercubes centered on each fixed point. These initial conditions are dynamically evolved. The linear size of each basin of attraction is finally determined by the proportion of initial conditions which converge back to the fixed point. Armed with this algorithm, we revisit the problem considered by Wiley et al. in a seminal paper [Chaos 16, 015103 (2006)] that inspired the title of the present manuscript and consider the equal-frequency Kuramoto model on a cycle. Fixed points of this model are characterized by an integer winding number q and the number n of oscillators. We find that the basin volumes scale as , contrasting with the Gaussian behavior postulated in the study by Wiley et al.. Finally, we show the applicability of our method to complex models of coupled oscillators with different natural frequencies and on meshed networks.
1 March 2017 in Journal of Mathematical Physics
The number of stable fixed points of locally coupled Kuramoto models depends on the topology of the network on which the model is defined. It has been shown that cycles in meshed networks play a crucial role in determining because any two different stable fixed points differ by a collection of loop flows on those cycles. Since the number of different loop flows increases with the length of the cycle that carries them, one expects to be larger in meshed networks with longer cycles. Simultaneously, the existence of more cycles in a network means more freedom to choose the location of loop flows differentiating between two stable fixed points. Therefore, should also be larger in networks with more cycles. We derive an algebraic upper bound for the number of stable fixed points of the Kuramoto model with identical frequencies, under the assumption that angle differences between connected nodes do not exceed . We obtain , which depends both on the number c of cycles and on the spectrum of their lengths {nk}. We further identify network topologies carrying stable fixed points with angle differences larger than , which leads us to conjecture an upper bound for the number of stable fixed points for Kuramoto models on any planar network. Compared to earlier approaches that give exponential upper bounds in the total number of vertices, our bounds are much lower and therefore much closer to the true number of stable fixed points.
2 January 2019 in SIAM Journal on Applied Dynamical Systems
Many real-world systems of coupled agents exhibit directed interactions, meaning that the influence of an agent on another is not reciprocal. Furthermore, interactions usually do not have an identical amplitude and/or sign. To describe synchronization phenomena in such systems, we use a generalized Kuramoto model with oriented, weighted, and signed interactions. Taking a bottom-up approach, we investigate the simplest possible oriented networks, namely, acyclic oriented networks and oriented cycles. These two types of networks are fundamental building blocks from which many general oriented networks can be constructed. For acyclic, weighted, and signed networks, we are able to completely characterize synchronization properties through necessary and sufficient conditions, which we show are optimal. Additionally, we prove that if it exists, a stable synchronous state is unique. In oriented, weighted, and signed cycles with identical natural frequencies, we show that the system globally synchronizes and that the number of stable synchronous states is finite.
19 March 2025 in Nature Communications
A plethora of methods have been developed in the past two decades to infer the underlying network structure of an interconnected system from its collective dynamics. However, methods capable of inferring nonpairwise interactions are only starting to appear. Here, we develop an inference algorithm based on sparse identification of nonlinear dynamics (SINDy) to reconstruct hypergraphs and simplicial complexes from time-series data. Our model-free method does not require information about node dynamics or coupling functions, making it applicable to complex systems that do not have a reliable mathematical description. We first benchmark the new method on synthetic data generated from Kuramoto and Lorenz dynamics. We then use it to infer the effective connectivity in the brain from resting-state EEG data, which reveals significant contributions from non-pairwise interactions in shaping the macroscopic brain dynamics.
17 June 2019 in Physical Review E
Complex physical systems are unavoidably subjected to external environments not accounted for in the set of differential equations that models them. The resulting perturbations are standardly represented by noise terms. If these terms are large enough, they can push the system from an initial stable equilibrium point, over a nearby saddle point, outside of the basin of attraction of the stable point. Except in some specific cases, the distance between these two points is not known analytically. Focusing on Kuramoto-like models and under simple assumptions on this distance, we derive conditions under which such noise terms perturb the dynamics strongly enough that they lead to stochastic escape from the initial basin of attraction. We numerically confirm the validity of that criterion for coupled oscillators on four very different complex networks. We find in particular that, quite counterintuitively, systems with inertia leave their initial basin faster than or at the same time as systems without inertia, except for strong white-noise perturbations.