We study nonzero-frequency phase-locked motions in asymmetrically coupled Kuramoto networks. Such motions are relative equilibria with fixed phase differences and a nonzero common angular velocity, and we call them dancing equilibria. Their existence requires all coupling sums to have the same nonzero value. We show that neither symmetric coupling nor an acyclic associated digraph can support a dancing equilibrium. We introduce structurally equitable and $q$-twisted state equitable partitions and prove a partition-based criterion for the resulting class-constant profiles, with standard labeled $q$-twisted profiles recovered from singleton partitions. For the forward $m$-neighbor model, we characterize existence by an exact indivisibility criterion. Stability is studied modulo the common phase-shift direction. For general directed networks, strong connectivity and edgewise phase differences in $\left(-\pi/2,\pi/2\right)$ imply local orbital exponential stability and yield an explicit positively invariant set contained in the local basin of attraction. For arbitrary twisted indices, this contraction argument gives a low-winding stability regime with explicit positively invariant neighborhoods. For each existing $q$-twisted branch of the forward model, a discrete Fourier transform criterion yields local orbital exponential stability when all nonzero Fourier-mode factors are positive and nonlinear instability when at least one is negative. In the unstable case, the proof constructs explicit escaping real Fourier perturbations. We further derive additional explicit stability and instability ranges for arbitrary twisted indices in terms of constants $N$, $m$, and $q$. For the first two twisted branches, sharper arguments yield a first-mode transition criterion for $q=1$ and a complete finite-size classification for $q=2$, with the degenerate case in each branch handled separately.
We study discrete networks of $N+1$ identical phase oscillators with positive reciprocal weights and smooth odd periodic interactions, motivated by discrete models of Huygens synchronisation. The interaction laws define an intrinsic potential, and removing the common phase gives a gradient map on the $N$-torus. A weigh...
Jorge Buescu, E. D'Aniello, Henrique M. Oliveira· 0 citations
In a mechanistic model of the dawn chorus, Kaye showed that heterogeneous activation thresholds and a shared feedback signal determined by the population's active fraction can produce abrupt collective activation and hysteresis. We extend this mechanism to a network of interacting agents. Each node has a continuous act...
We propose a finite-dimensional cochain model for information flow on an online communication complex. Node variables represent issue positions, while edge variables represent independently modelled signed information flow. The coupling is written in terms of the coboundary operator $d_0$ and the $1$-cochain Hodge Lapl...
In this paper, we systematically study a variant of the scaled relative graph (SRG), referred to as the $\theta$-symmetric SRG, and apply it to the stability analysis of cactus networks. Compared with the previous SRG definition, the $\theta$-symmetric SRG enables the characterization of phase lead and lag behaviors, a...
We study how network connectivity and heterogeneous phase-delays shape the spatiotemporal dynamics of finite oscillator networks. Phase-delays can destabilize global synchronization and promote phase-locked patterns, including states with uniform phase gradients and more complex combinations of these modes. Yet, how co...
K. L. Rossi, Antonio Mihara, L. Muller et al.· 0 citations
Higher-order interactions on simplicial complexes can generate synchronization transitions and multistable collective states that do not appear in purely pairwise network models. Here we study a minimal analytically tractable motif formed by gluing two complete K5 cliques along a common s-clique, with s=1,2,3,4. For a...
Samir Sahoo, N. Gupte· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.