Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Size of the Sync Basin Revisited

Published 1 Jun 2017 in nlin.AO, math-ph, and math.MP | (1706.00344v3)

Abstract: In dynamical systems, the full stability of fixed point solutions is determined by their basin 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 [D. A. Wiley {\it et al.} Chaos {\bf 16}, 015103 (2006), P. J. Menck {\it et al.} Nat. Phys. {\bf 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 [D. A. Wiley {\it et al.} Chaos {\bf 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 $(1-4q/n)n$, contrasting with the Gaussian behavior postulated in Wiley et al.'s paper. Finally, we show the applicability of our method to complex models of coupled oscillators with different natural frequencies and on meshed networks.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.