C. Bonanno, S. Galatolo, S. Isola
In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $ \{0,1\}^{\NN}$ with the uniform measure and the usual shift so that effective versions of the multiple recurrence theorem of Furstenberg holds for iterations starting at the point. We consider recurrence into closed sets that possess various degrees of effectiveness: clopen, $\PPI$ with computable measure, and $\PPI$. The notions of Kurtz, Schnorr, and \ML\ ran…
Replicator dynamics, the continuous-time analogue of Multiplicative Weights Updates, is the main dynamic in evolutionary game theory. In simple evolutionary zero-sum games, such as Rock-Paper-Scissors, replicator dynamic is periodic \cite{zeeman1980population}, however, its behavior in higher dimensions is not well understood. We provide a complete characterization of its behavior in zero-sum evolutionary games. We prove that, if and only if, the system has an interior Nash equilibrium, the dynamics exhibit Poincaré recurrence, i.e., almost all orbits come arbitrary close to their initial cond…
We show that, under suitable assumptions, Poincare recurrences of a dynamical system determine its topology in phase space. Therefore, dynamical systems with the same recurrences are topologically equivalent.
In this paper we prove estimates on the behaviour of the Kolmogorov-Sinai entropy relative to a partition for randomly perturbed dynamical systems. Our estimates use the entropy for the unperturbed system and are obtained using the notion of Algorithmic Information Content. The main result is an extension of known results to study time series obtained by the observation of real systems.
For non-uniformly hyperbolic dynamical systems we consider the time series of maxima along typical orbits. Using ideas based upon quantitative recurrence time statistics we prove convergence of the maxima (under suitable normalization) to an extreme value distribution, and obtain estimates on the rate of convergence. We show that our results are applicable to a range of examples, and include new results for Lorenz maps, certain partially hyperbolic systems, and non-uniformly expanding systems with sub-exponential decay of correlations. For applications where analytic results are not readily av…
Measuring the average information that is necessary to describe the behaviour of a dynamical system leads to a generalization of the Kolmogorov-Sinai entropy. This is particularly interesting when the system has null entropy and the information increases less than linearly with respect to time. We consider two classes of maps of the interval with an indifferent fixed point at the origin and an infinite natural invariant measure. We calculate that the average information that is necessary to describe the behaviour of its orbits increases with time $n$ approximately as $n^α$, where $α<1$ depends…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is why, the aim of our paper is to formulate and solve problems concerning nonautonomous multitime multiple recurrence equations. Among other things, we discuss in detail the cases of linear recurrences with constant coefficients, highlighting in particular the theorems of existence and uniqueness of solutions.
We consider finitely generated free semigroup actions on a compact metric space and obtain quantitative information on Poincaré recurrence, average first return time and hitting frequency for the random orbits induced by the semigroup action. Besides, we relate the recurrence to balls with the rates of expansion of the semigroup's generators and the topological entropy of the semigroup action. Finally, we establish a partial variational principle and prove an ergodic optimization for this kind of dynamical action.
In this paper I conceptualise a novel approach for capturing coincidences between events that have not necessarily an observed causal relationship. Building on the Transcendental Information Cascades approach I outline a tensor theory of the interaction between rare micro-level events and macro-level system changes. Afterwards, I discuss a number of application areas that are promising candidates for the validation of the theoretical assumptions outlined here in practice. This is preliminary work that is sought to lay the foundation to discover universal mathematical properties of coincidences…
Previous work has shown that perturbation analysis in software space can produce candidate computable generative models and uncover possible causal properties from the finite description of an object or system quantifying the algorithmic contribution of each of its elements relative to the whole. One of the challenges for defining emergence is that one observer's prior knowledge may cause a phenomenon to present itself to such observer as emergent while for another as reducible. By formalising the act of observing as mutual perturbations between dynamical systems, we demonstrate that emergence…
Without loss of generalisation to other systems, including possibly non-deterministic ones, we demonstrate the application of methods drawn from algorithmic information dynamics to the characterisation and classification of emergent and persistent patterns, motifs and colliding particles in Conway's Game of Life (GoL), a cellular automaton serving as a case study illustrating the way in which such ideas can be applied to a typical discrete dynamical system. We explore the issue of local observations of closed systems whose orbits may appear open because of inaccessibility to the global rules g…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。