Phase-delays shape multistability and basin sizes in Kuramoto networks: analytical estimates from network structure
arXiv:2609.02047
2026
Dynamics
2 ideas extracted · analyzed Sep 3, 2026
What the math gives to ML
The paper offers a nonstandard spectral mechanism in which a composite matrix combining network connectivity and heterogeneous phase delays predicts both linear stability and basin sizes of phase-locked states. This is transferable to phase-based recurrent or neural-ODE architectures by treating learned interactions as a graph with trainable phase offsets and constraining the spectrum of the corresponding cosine-weighted interaction matrix. The most direct implementation is a spectral-margin regularizer and initialization procedure for attracting latent memories or multiple dynamical modes. Its predictions are falsifiable: divergence should occur near the predicted eigenvalue boundary, while basin frequencies should change systematically when the composite spectrum is reshaped.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Build a continuous-time or discretized recurrent network whose interaction graph has trainable magnitudes and phase delays, then regularize the spectrum of the phase-corrected interaction matrix around each desired latent phase-locked state. The cosine-weighted composite matrix determines whether perturbations contract or grow, providing a computable stability margin instead of relying only on empirical exploding-gradient detection.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use several phase-locked states as distinct attractors of one recurrent network and shape their basin asymmetry through the phase-delay composite spectrum. This creates a controllable associative-memory architecture in which a desired memory receives a larger basin without adding a separate classifier or explicit nearest-neighbor lookup.
Useful7/10
Difficulty7/10
Novelty8/10