Topological invariants in the study of a chaotic food chain system

The study of ecological systems has generated deep interest in exploring the complexity of chaotic food chains. The role of chaos in ecosystems is not entirely understood. One approach to have a better comprehension of ecological chaos is by analyzing it in mathematical models of basic food chains. In this article it is considered a classical chaotic food chain model from the literature. We use the theory of symbolic dynamics to study the topological entropy and the parameter space ordering of kneading sequences associated with one-dimensional maps that reproduce significant aspects of the model dynamics. The topological entropy allows us to distinguish different chaotic states in some realistic system parameter region. Another numerical invariant is introduced in order to characterize isentropic dynamics. Studying a set of maps with the same topological entropy, we exhibit numerical results about the relation between the second topological invariant and each of the control parameters in consideration. This work provides an illustration of how our understanding of ecological models can be enhanced by the theory of symbolic dynamics.     

Exact complexity of the logistic map

The relation between chaotic behavior and complexity for one-dimensional maps is discussed. The one-dimensional maps are mapped into a binary string via symbolic dynamics in order to evaluate the complexity. We apply the complexity measure of Lempel and Ziv to these binary strings. To characterize the chaotic behavior, we calculate the Liapunov exponent. We show that the exact normalized complexity for the logistic mapf: [0,1]→[0,1],f(x)=4x(1−x) is given by 1.     

Information flow and maximum entropy measures for 1-D maps

The invariant measures of maximal metric entropy are constructed explicitly for some maps of the interval, by iterating the maps backward. The construction illustrates in a particularly clear way the information flow in simple systems, as well as recently conjectured relationships between dimensions of invariant measures, Lyapunov exponents, and entropies. maps, it is conjectured that the natural measure is the invariant measure with strongest mixing.     

The order of chaos on a Bianchi-IX cosmological model

The purpose of this paper is to analyze the chaotic behavior that can arise on a type-IX cosmological model using methods from dynamic systems theory and symbolic dynamics. Specifically, instead of the Belinski-Khalatnikov-Lifschitz model, we use the iterates of a monotonously increasing map of the circle with a discontinuity, and for the Hamiltonean dynamics of Misner's Mixmaster model we introduce the iterates of a noninvertible map. An equivalence between these two models can easily be brought upon by translating them in symbolic-dynamical terms. The resulting symbolic orbits can be inserted in an ordered tree structure set, and so we can present an effective counting and referentation of all period orbits.     

Chaotic Entanglement: Entropy and Geometry

In chaotic entanglement, pairs of interacting classically-chaotic systems are induced into a state of mutual stabilization that can be maintained without external controls and that exhibits several properties consistent with quantum entanglement. In such a state, the chaotic behavior of each system is stabilized onto one of the system’s many unstable periodic orbits (generally located densely on the associated attractor), and the ensuing periodicity of each system is sustained by the symbolic dynamics of its partner system, and vice versa. Notably, chaotic entanglement is an entropy-reversing event: the entropy of each member of an entangled pair decreases to zero when each system collapses onto a given period orbit. In this paper, we discuss the role that entropy plays in chaotic entanglement. We also describe the geometry that arises when pairs of entangled chaotic systems organize into coherent structures that range in complexity from simple tripartite lattices to more involved patterns. We conclude with a discussion of future research directions.     

Multiparameter Critical Situations, Universality and Scaling in Two-Dimensional Period-Doubling Maps

We review critical situations, linked with period-doubling transition to chaos, which require using at least two-dimensional maps as models representing the universality classes. Each of them corresponds to a saddle solution of the two-dimensional generalization of Feigenbaum-Cvitanovi? equation and is characterized by a set of distinct universal constants analogous to Feigenbaum’s α and δ. One type of criticality designated H was discovered by several authors in 80-th in the context of period doubling in conservative dynamics, but occurs as well in dissipative dynamics, as a phenomenon of codimension 2. Second is bicritical behavior, which takes place in systems allowing decomposition onto two dissipative period-doubling subsystems, each of which is brought by parameter tuning onto a threshold of chaos. Types of criticality designated as FQ and C occur in non-invertible two-dimensional maps. We present and discuss a number of realistic systems manifesting those types of critical behavior and point out some relevant conditions of their potential observation in physical systems. In particular, we indicate a possibility for realization of the H type criticality without vanishing dissipation, but with its compensation in a self-oscillatory system. Next, we present a number of examples (coupled Hénon-like maps, coupled driven oscillators, coupled chaotic self-oscillators), which manifest bicritical behavior. For FQ-type we indicate possibility to arrange it in non-symmetric systems of coupled period-doubling subsystems, e.g. in Hénon-like maps and in Chua’s circuits. For C-type we present examples of its appearance in a driven Rössler oscillator at the period-doubling accumulation on the edge of syncronization tongue and in a model map with the Neimark–Sacker bifurcation     

Quantifying chaos for ecological stoichiometry

The theory of ecological stoichiometry considers ecological interactions among species with different chemical compositions. Both experimental and theoretical investigations have shown the importance of species composition in the outcome of the population dynamics. A recent study of a theoretical three-species food chain model considering stoichiometry [B. Deng and I. Loladze, Chaos 17, 033108 (2007)] shows that coexistence between two consumers predating on the same prey is possible via chaos. In this work we study the topological and dynamical measures of the chaotic attractors found in such a model under ecological relevant parameters. By using the theory of symbolic dynamics, we first compute the topological entropy associated with unimodal Poincare? return maps obtained by Deng and Loladze from a dimension reduction. With this measure we numerically prove chaotic competitive coexistence, which is characterized by positive topological entropy and positive Lyapunov exponents, achieved when the first predator reduces its maximum growth rate, as happens at increasing δ1. However, for higher values of δ1 the dynamics become again stable due to an asymmetric bubble-like bifurcation scenario. We also show that a decrease in the efficiency of the predator sensitive to prey's quality (increasing parameter ζ) stabilizes the dynamics. Finally, we estimate the fractal dimension of the chaotic attractors for the stoichiometric ecological model.     

Control of transient chaos in tent maps near crisis. I. Fixed point targeting

Combinatorial techniques are applied to the symbolic dynamics representing transient chaotic behavior in tent maps in order to solve the problem of Ott-Grebogi-Yorke control to the nontrivial fixed point occurring in such maps. This approach allows "preimage overlap" to be treated exactly. Closed forms for both the probability of control being achieved and the average number of iterations to control are derived. The results are discussed in relation to the work of Tel and shed new light on the transition to the control of permanent chaos.     

Completely mixing quantum open systems and quantum fractals

Departing from classical concepts of ergodic theory, formulated in terms of probability densities, measures describing the mixing behavior and the loss of information in quantum open systems are proposed. As application we discuss the chaotic outcomes of continuous measurement processes in the EEQT framework. Simultaneous measurement of four noncommuting spin components is shown to lead to a chaotic jumps on the quantum spin sphere and to generate specific fractal images of a nonlinear iterated function system.     

Chaos control in a discrete time system through asymmetric coupling

We study a pair of asymmetrically coupled identical chaotic quadratic maps. We investigate, via numerical simulations, chaos suppression associated with the variation of both parameters, the coupling parameter and the parameter which measures the asymmetry. This is a new technique recently introduced for chaos suppression in continuous systems and, as far we know, not yet tested for discrete systems. Parameter-space regions where the chaotic dynamics is driven towards regular dynamics are shown. Lyapunov exponents and phase-space plots are also used to characterize the phenomenon observed as the parameters are changed.     

Dynamics characterization of modified Gross–Pitaevskii equation

The dynamics of dissipative and coherent N$N$-body systems, such as a Bose–Einstein condensate, which can be described by an extended Gross–Pitaevskii formalism, is investigated. In order to analyze chaotic and unstable regimes, two approaches are considered: a metric one, based on calculations of Lyapunov exponents, and an algorithmic one, based on the Lempel–Ziv criterion. The consistency of both approaches is established, with the Lempel–Ziv algorithmic found as an efficient complementary approach to the metric one for the fast characterization of dynamical behaviors obtained from finite sequences.     

A note on chaotic unimodal maps and applications

Based on the word-lift technique of symbolic dynamics of one-dimensional unimodal maps, we investigate the relation between chaotic kneading sequences and linear maximum-length shift-register sequences. Theoretical and numerical evidence that the set of the maximum-length shift-register sequences is a subset of the set of the universal sequence of one-dimensional chaotic unimodal maps is given. By stabilizing unstable periodic orbits on superstable periodic orbits, we also develop techniques to control the generation of long binary sequences.     

一种确定混沌伪随机序列复杂度的模糊关系熵测度

将模糊关系的概念引入混沌伪随机序列复杂度的测度方法之中,提出了一种新的混沌伪随机序列复杂度测度方法——模糊关系熵(fuzzy relationship entropy,简记为F-REn)测度方法,并推导了F-REn的两个基本性质.仿真结果表明,该测度方法能够有效测度混沌伪随机序列的复杂度,与近似熵(ApEn)测度方法和符号熵测度方法相比,F-REn测度具有更加好的对序列符号空间的适用性、更加小的对测量维度的敏感性和更加强的对分辨率参数的鲁棒性. 关键词： 混沌伪随机序列 模糊理论 复杂度     

格子复杂性和符号序列的细粒化

提出一种新的有限长一维符号序列的复杂性度量——格子复杂性，建立在Lempel Ziv复杂性和一维迭代映射系统的符号动力学基础上.同时提出了符号序列的细粒化方法，可与格子复杂性以及Lempel Ziv复杂性结合.新度量在细粒化指数较小时与Lempel Ziv复杂性基本一致，在细粒化指数增大时显示出截然不同的特性.以Logistic映射为对象的计算实验表明，格子复杂性对混沌区的边缘最敏感.最后还讨论了上述复杂性度量的其他一些重要性质. 关键词： 混沌 复杂性度量 格子复杂性 细粒化     

Chaotic scattering and transmission fluctuations

We discuss the phenomenon of chaotic scattering and its application in the study of transmission of electrons in mesoscopic devices as well as the transmission of microwaves through junctions. We show that the fact that the ray optics (classical dynamics) is chaotic, implies fluctuations in the observed transmission coefficients, whose statistics is determined by the theory of random matrices. We also show how the classical distribution functions which reflect the chaotic nature of the classical dynamics, determine the dependence of the correlations observed in the fluctuating transmission coefficients on external parameters. The time domain properties of chaotic scattering systems are also examined, and are shown to depend on the chaotic nature of the classical dynamics, together with a wave mechanical enhancement in time reversal invariant systems. Finally, we study the role of absorption and discuss its effects on the transmission fluctuations and their statistics.     

Legendre structure of the thermostatistics theory based on the Sharma–Taneja–Mittal entropy

The statistical proprieties of complex systems can differ deeply for those of classical systems governed by Boltzmann–Gibbs entropy. In particular, the probability distribution function observed in several complex systems shows a power-law behavior in the tail which disagrees with the standard exponential behavior showed by Gibbs distribution. Recently, a two-parameter deformed family of entropies, previously introduced by Sharma, Taneja and Mittal (STM), has been reconsidered in the statistical mechanics framework. Any entropy belonging to this family admits a probability distribution function with an asymptotic power-law behavior. In the present work we investigate the Legendre structure of the thermostatistics theory based on this family of entropies. We introduce some generalized thermodynamical potentials, study their relationships with the entropy and discuss their main proprieties. Specialization of the results to some one-parameter entropies belonging to the STM family are presented.     

A complexity measure approach based on forbidden patterns and correlation degree

Based on forbidden patterns in symbolic dynamics, symbolic subsequences are classified and relations between forbidden patterns, correlation dimensions and complexity measures are studied. A complexity measure approach is proposed in order to separate deterministic (usually chaotic) series from random ones and measure the complexities of different dynamic systems. The complexity is related to the correlation dimensions, and the algorithm is simple and suitable for time series with noise. In the paper, the complexity measure method is used to study dynamic systems of the Logistic map and the H\'enon map with multi-parameters.     

Order patterns and chaos

Chaotic maps can mimic random behavior in a quite impressive way. In particular, those possessing a generating partition can produce any symbolic sequence by properly choosing the initial state. We study in this Letter the ability of chaotic maps to generate order patterns and come to the conclusion that their performance in this respect falls short of expectations. This result reveals some basic limitation of a deterministic dynamic as compared to a random one. This being the case, we propose a non-statistical test based on ‘forbidden’ order patterns to discriminate chaotic from truly random time series with, in principle, arbitrarily high probability. Some relations with discrete chaos and chaotic cryptography are also discussed.     

Chaos forgets and remembers: Measuring information creation,destruction, and storage

The hallmark of deterministic chaos is that it creates information—the rate being given by the Kolmogorov–Sinai metric entropy. Since its introduction half a century ago, the metric entropy has been used as a unitary quantity to measure a system's intrinsic unpredictability. Here, we show that it naturally decomposes into two structurally meaningful components: A portion of the created information—the ephemeral information—is forgotten and a portion—the bound information—is remembered. The bound information is a new kind of intrinsic computation that differs fundamentally from information creation: it measures the rate of active information storage. We show that it can be directly and accurately calculated via symbolic dynamics, revealing a hitherto unknown richness in how dynamical systems compute.     

Computing with distributed chaos

We describe and discuss in detail some recent results by Sinha and Ditto [Phys. Rev. Lett. 81, 2156 (1998)] demonstrating the capacity of a lattice of threshold coupled chaotic maps to perform computations. Such systems are shown to emulate logic gates, encode numbers, and perform specific arithmetic operations, such as addition and multiplication, as well as yield more specialized operations such as the calculation of the least common multiplier of a sequence of numbers. Furthermore, we extend the scheme to multidimensional continuous time dynamics, in particular to a system relevant to chaotic lasers.