相关论文: Recurrence and algorithmic information

Presence of recurrent and statistically significant unstable periodic orbits (UPOs) in time series obtained from biological systems are now routinely used as evidence for low dimensional chaos . Extracting accurate dynamical information…

The concept of structural invariance previously introduced by the authors is used to argue that the connection between random matrix theory and quantum systems with a chaotic classical counterpart is in fact largely exact in the…

Periodic orbit theory allows calculations of long time properties of chaotic systems from traces, dynamical zeta functions and spectral determinants of deterministic evolution operators, which are in turn evaluated in terms of periodic…

Identifying the types of orbits is an important topic in the study of chaotic dynamical systems. Beyond the well-known distinctly chaotic and regular motions, we focus on dynamics occurring in regions where regular and chaotic motions…

Homoclinic and heteroclinic orbits provide a skeleton of the full dynamics of a chaotic dynamical system and are the foundation of semiclassical sums for quantum wave packet, coherent state, and transport quantities. Here, the homoclinic…

Periodically-driven systems are ubiquitous in science and technology. In quantum dynamics, even a small number of periodically-driven spins leads to complicated dynamics. Hence, it is of interest to understand what constraints such dynamics…

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [9]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a…

Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…

This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on…

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…

Heteroclinic cycles are widely used in neuroscience in order to mathematically describe different mechanisms of functioning of the brain and nervous system. Heteroclinic cycles and interactions between them can be a source of different…

We present here a new method which applies well ordered symbolic dynamics to find unstable periodic and non-periodic orbits in a chaotic system. The method is simple and efficient and has been successfully applied to a number of different…

This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are…

We investigate the recurrence properties of the time series of quantum mechanical expectation values, in terms of two representative models for a single-mode radiation field interacting with a nonlinear medium. From recurrence-time…

Estimating causal interactions in complex dynamical systems is an important problem encountered in many fields of current science. While a theoretical solution for detecting the causal interactions has been previously formulated in the…

We investigate the effect of repeated measurement for quantum dynamics of the suppressed systems which classical counterparts exhibit chaos. The essential feature of such systems is the quantum localization phenomena strongly limiting…

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

This paper studies the problem of recursively estimating the weighted adjacency matrix of a network out of a temporal sequence of binary-valued observations. The observation sequence is generated from nonlinear networked dynamics in which…

We investigate the dependence of Poincar\'e recurrence-times statistics on the choice of recurrence-set, by sampling the dynamics of two- and four-dimensional Hamiltonian maps. We derive a method that allows us to visualize the direct…