For a chaotic system pairs of initially close-by trajectories become eventually fully uncorrelated on the attracting set. This process of decorrelation can split into an initial exponential decrease and a subsequent diffusive process on the chaotic attractor causing the final loss of predictability. Both processes can be either of the same or of very different time scales. In the latter case the two trajectories linger within a finite but small distance (with respect to the overall extent of the attractor) for exceedingly long times and remain partially predictable. Standard tests for chaos widely use inter-orbital correlations as an indicator. However, testing partially predictable chaos yields mostly ambiguous results, as this type of chaos is characterized by attractors of fractally broadened braids. For a resolution we introduce a novel 0–1 indicator for chaos based on the cross-distance scaling of pairs of initially close trajectories. This test robustly discriminates chaos, including partially predictable chaos, from laminar flow. Additionally using the finite time cross-correlation of pairs of initially close trajectories, we are able to identify laminar flow as well as strong and partially predictable chaos in a 0–1 manner solely from the properties of pairs of trajectories.

The time needed to exchange information in the physical world induces a delay term when the respective system is modeled by differential equations. Time delays are hence ubiquitous, being furthermore likely to induce instabilities and with it various kinds of chaotic phases. Which are then the possible types of time delays, induced chaotic states, and methods suitable to characterize the resulting dynamics? This review presents an overview of the field that includes an in-depth discussion of the most important results, of the standard numerical approaches and of several novel tests for identifying chaos. Special emphasis is placed on a structured representation that is straightforward to follow. Several educational examples are included in addition as entry points to the rapidly developing field of time delay systems.

In dynamical systems with distinct time scales the time evolution in phase space may be influenced strongly by the fixed points of the fast subsystem. Orbits then typically follow these points, performing in addition rapid transitions between distinct branches on the time scale of the fast variables. As the branches guide the dynamics of a system along the manifold of former fixed points, they are considered transiently attracting states and the intermittent transitions between branches correspond to state switching within transient-state dynamics. A full characterization of the set of former fixed points, the critical manifold, tends to be difficult in high-dimensional dynamical systems such as large neural networks. Here we point out that an easily computable subset of the critical manifold, the set of target points, can be used as a reference for the investigation of high-dimensional slow-fast systems. The set of target points corresponds in this context to the adiabatic projection of a given orbit to the critical manifold. Applying our framework to a simple recurrent neural network, we find that the scaling relation of the Euclidean distance between the trajectory and its target points with the control parameter of the slow time scale allows to distinguish an adiabatic regime from a state that is effectively independent from target points.

No abstract

No abstract