Double Standard Maps

We investigate the family of double standard maps of the circle onto itself, given by (mod 1), where the parameters a,b are real and 0 ≤ b ≤ 1. Similarly to the well known family of (Arnold) standard maps of the circle, (mod 1), any such map has at most one attracting periodic orbit and the set of parameters (a,b) for which such orbit exists is divided into tongues. However, unlike the classical Arnold tongues that begin at the level b = 0, for double standard maps the tongues begin at higher levels, depending on the tongue. Moreover, the order of the tongues is different. For the standard maps it is governed by the continued fraction expansions of rational numbers; for the double standard maps it is governed by their binary expansions. We investigate closer two families of tongues with different behavior. The first author was partially supported by NSF grant DMS 0456526. The second author was supported by FCT Grant SFRH/BD/18631/2004. CMUP is supported by FCT through POCTI and POSI of Quadro Comunitário de apoio III (2000-2006) with FEDER and national funding.     

Various Auto-Correlation Functions of m-Bit Random Numbers Generated from Chaotic Binary Sequences

This paper discusses the auto-correlation functions of m-bit random numbers obtained from m chaotic binary sequences generated by one-dimensional nonlinear maps. First, we provide the theoretical auto-correlation function of an m-bit sequence obtained by m binary sequences that are assumed to be uncorrelated to each other. The auto-correlation function is expressed by a simple form using the auto-correlation functions of the binary sequences. This implies that the auto-correlation properties of the m-bit sequences can be easily controlled by the auto-correlation functions of the original binary sequences. In numerical experiments using a computer, we generated m-bit random sequences using some chaotic binary sequences with prescribed auto-correlations generated by one-dimensional chaotic maps. The numerical experiments show that the numerical auto-correlation values are almost equal to the corresponding theoretical ones, and we can generate m-bit sequences with a variety of auto-correlation properties. Furthermore, we also show that the distributions of the generated m-bit sequences are uniform if all of the original binary sequences are balanced (i.e., the probability of 1 (or 0) is equal to 1/2) and independent of one another.     

On the Zero-Temperature Limit of Gibbs States

We exhibit Lipschitz (and hence Hölder) potentials on the full shift ${\{0,1\}^{\mathbb{N}}}We exhibit Lipschitz (and hence H?lder) potentials on the full shift {0,1}^\mathbbN{\{0,1\}^{\mathbb{N}}} such that the associated Gibbs measures fail to converge as the temperature goes to zero. Thus there are “exponentially decaying” interactions on the configuration space {0,1}^{\mathbb Z}{\{0,1\}^{\mathbb Z}} for which the zero-temperature limit of the associated Gibbs measures does not exist. In higher dimension, namely on the configuration space {0,1}^\mathbbZd{\{0,1\}^{\mathbb{Z}^{d}}}, d ≥ 3, we show that this non-convergence behavior can occur for the equilibrium states of finite-range interactions, that is, for locally constant potentials.     

Invariants and chaotic maps

A one-dimensional mapf(x) is called an invariant of a two-dimensional mapg(x, y) ifg(x, f(x))=f(f(x)). The logistic map is an invariant of a class of two-dimensional maps. We construct a class of two-dimensional maps which admit the logistic maps as their invariant. Moreover, we calculate their Lyapunov exponents. We show that the two-dimensional map can show hyperchaotic behavior.     

Higher Dimensional Bianchi Type-V Cosmological Models with Perfect Fluid and Dark Energy

We have studied the Bianchi type-V cosmological models with binary mixture of perfect fluid and dark energy in five dimensions. The perfect fluid is obeying the equation of state p=γρ with γ∈[0,1]. The dark energy is considered to be either the quintessence or the Chaplygin gas. The exact solutions of the Einstein’s field equations are obtained in quadrature form.     

Harmonic Averages and New Explicit Constants for Invariant Densities of Piecewise Expanding Maps of the Interval

The statistical behavior of families of maps is important in studying the stability properties of chaotic maps. For a piecewise expanding map τ whose slope >2 in magnitude, much is known about the stability of the associated invariant density. However, when the map has slope magnitude ≤2 many different behaviors can occur as shown in (Keller in Monatsh. Math. 94(4): 313–333, 1982) for W maps. The main results of this note use a harmonic average of slopes condition to obtain new explicit constants for the upper and lower bounds of the invariant probability density function associated with the map, as well as a bound for the speed of convergence to the density. Since these constants are determined explicitly the results can be extended to families of approximating maps.     

Dynamics of delayed-coupled chaotic logistic maps: Influence of network topology,connectivity and delay times

We review our recent work on the synchronization of a network of delay-coupled maps, focusing on the interplay of the network topology and the delay times that take into account the finite velocity of propagation of interactions. We assume that the elements of the network are identical (N logistic maps in the regime where the individual maps, without coupling, evolve in a chaotic orbit) and that the coupling strengths are uniform throughout the network. We show that if the delay times are sufficiently heterogeneous, for adequate coupling strength the network synchronizes in a spatially homogeneous steady state, which is unstable for the individual maps without coupling. This synchronization behavior is referred to as ‘suppression of chaos by random delays’ and is in contrast with the synchronization when all the interaction delay times are homogeneous, because with homogeneous delays the network synchronizes in a state where the elements display in-phase time-periodic or chaotic oscillations. We analyze the influence of the network topology considering four different types of networks: two regular (a ring-type and a ring-type with a central node) and two random (free-scale Barabasi-Albert and small-world Newman-Watts). We find that when the delay times are sufficiently heterogeneous the synchronization behavior is largely independent of the network topology but depends on the network’s connectivity, i.e., on the average number of neighbors per node.      

Collective behavior in coupled chaotic map lattices with random perturbations

Numerical simulations of coupled map lattices with non-local interactions (i.e., the coupling of a given map occurs with all lattice sites) often involve a large computer time if the lattice size is too large. In order to study dynamical effects which depend on the lattice size we considered the use of small truncated lattices with random inputs at their boundaries chosen from a uniform probability distribution. This emulates a “thermal bath”, where deterministic degrees of freedom exhibiting chaotic behavior are replaced by random perturbations of finite amplitude. We demonstrate the usefulness of this idea to investigate the occurrence of completely synchronized chaotic states as the coupling parameters are varied. We considered one-dimensional lattices of chaotic logistic maps at outer crisis x→4x(1−x).     

Clustering of exponentially separating trajectories

It might be expected that trajectories of a dynamical system which has no negative Lyapunov exponent (implying exponential growth of small separations) will not cluster together. However, clustering can occur such that the density ρ(Δx) of trajectories within distance |Δx| of a reference trajectory has a power-law divergence, so that ρ(Δx) ∼ |Δx| ^−β when |Δx| is sufficiently small, for some 0 < β < 1. We demonstrate this effect using a random map in one dimension. We find no evidence for this effect in the chaotic logistic map, and argue that the effect is harder to observe in deterministic maps.     

Periodic orbits in a two-variable coupled map

Periodic orbits are calculated for a linear transformation composed of two coupled tent maps using a symbolic dynamics defined as the direct product of the single-map symbols {0,1,2}. As the coupling strength is increased orbits are pruned and a crossover to one-dimensional behavior is observed. The disallowed binary orbits containing only symbols {0,1} form a connected region in a binary symbol plane. Stable orbits may appear for strong couplings.     

Statistics of Advective Stretching in Three-dimensional Incompressible Flows

We present a method to quantify kinematic stretching in incompressible, unsteady, isoviscous, three-dimensional flows. We extend the method of Kellogg and Turcotte (J. Geophys. Res. 95:421–432, 1990) to compute the axial stretching/thinning experienced by infinitesimal ellipsoidal strain markers in arbitrary three-dimensional incompressible flows and discuss the differences between our method and the computation of Finite Time Lyapunov Exponent (FTLE). We use the cellular flow model developed in Solomon and Mezic (Nature 425:376–380, 2003) to study the statistics of stretching in a three-dimensional unsteady cellular flow. We find that the probability density function of the logarithm of normalised cumulative stretching (log S) for a globally chaotic flow, with spatially heterogeneous stretching behavior, is not Gaussian and that the coefficient of variation of the Gaussian distribution does not decrease with time as t^-\frac12t^{-\frac{1}{2}} . However, it is observed that stretching becomes exponential log S∼t and the probability density function of log S becomes Gaussian when the time dependence of the flow and its three-dimensionality are increased to make the stretching behaviour of the flow more spatially uniform. We term these behaviors weak and strong chaotic mixing respectively. We find that for strongly chaotic mixing, the coefficient of variation of the Gaussian distribution decreases with time as t^-\frac12t^{-\frac{1}{2}} . This behavior is consistent with a random multiplicative stretching process.     

Emergent organization of oscillator clusters in coupled self-regulatory chaotic maps

Here we introduce a model of parametrically coupled chaotic maps on a one-dimensional lattice. In this model, each element has its internal self-regulatory dynamics, whereby at fixed intervals of time the nonlinearity parameter at each site is adjusted by feedback from its past evolution. Additionally, the maps are coupled sequentially and unidirectionally, to their nearest neighbor, through the difference of their parametric variations. Interestingly we find that this model asymptotically yields clusters of superstable oscillators with different periods. We observe that the sizes of these oscillator clusters have a power-law distribution. Moreover, we find that the transient dynamics gives rise to a 1/f power spectrum. All these characteristics indicate self-organization and emergent scaling behavior in this system. We also interpret the power-law characteristics of the proposed system from an ecological point of view.      

Local and global statistical properties of deterministic chaos

Summary Locla and global statistical properties of a class of one-dimensional dissipative chaotic maps and a class of 2-dimensional conservative hyperbolic maps are investigated. This is achieved by considering the spectral properties of the Perron-Frobenius operator (the evolution operator for probability densities) acting on two different types of function space. In the first case, the function space is piecewise analytic, and includes functions having support over local regions of phase space. In the second case, the function space essentially consists of functions which are “globally? analytic,i.e. analytic over the given systems entire phase space. Each function space defines a space of measurable functions or observables, whose statistical moments and corresponding characteristic times can be exactly determined. Paper presented at the International Workshop ?Fluctuations in Physics and Biology: Stochastic Resonance, Signal Processing and Related Phenomena?, Elba, 5–10 June 1994.     

Bianchi type-V model with a perfect fluid and A-term

A self-consistent system of gravitational field with a binary mixture of perfect fluid and dark energy given by a cosmological constant has been considered in Bianchi Type-V universe. The perfect fluid is chosen to be obeying either the equation of state p=γρ with γ ε |0,1| or a van der Waals equation of state. The role of A-term in the evolution of the Bianchi Type-V universe has been studied.     

Special electronic structures of inverse spinels LiMVO<Subscript>4</Subscript>(M = Ni and Cu): a first-principles study

We use the Ulam method to study spectral properties of the Perron-Frobenius operators of dynamical maps in a chaotic regime. For maps with absorption we show numerically that the spectrum is characterized by the fractal Weyl law recently established for nonunitary operators describing poles of quantum chaotic scattering with the Weyl exponent ν = d-1, where d is the fractal dimension of corresponding strange set of trajectories nonescaping in future times. In contrast, for dissipative maps we numerically find the Weyl exponent ν = d/2 where d is the fractal dimension of strange attractor. The Weyl exponent can be also expressed via the relation ν = d₀/2 where d₀ is the fractal dimension of the invariant sets. We also discuss the properties of eigenvalues and eigenvectors of such operators characterized by the fractal Weyl law.     

A Maximum Entropy Method Based on Piecewise Linear Functions for the Recovery of a Stationary Density of Interval Mappings

Let S:[0,1]→[0,1] be a nonsingular transformation such that the corresponding Frobenius-Perron operator P _S :L ¹(0,1)→L ¹(0,1) has a stationary density f ^∗. We propose a maximum entropy method based on piecewise linear functions for the numerical recovery of f ^∗. An advantage of this new approximation approach over the maximum entropy method based on polynomial basis functions is that the system of nonlinear equations can be solved efficiently because when we apply Newton’s method, the Jacobian matrices are positive-definite and tri-diagonal. The numerical experiments show that the new maximum entropy method is more accurate than the Markov finite approximation method, which also uses piecewise linear functions, provided that the involved moments are known. This is supported by the convergence rate analysis of the method.     

混沌伪随机序列的谱熵复杂性分析

为了准确分析混沌伪随机序列的结构复杂性,采用谱熵算法对Logistic映射、Gaussian映射和TD-ERCS系统产生的混沌伪随机序列复杂度进行了分析.谱熵算法具有参数少、对序列长度N(惟一参数)和伪随机进制数K鲁棒性好的特点.采用窗口滑动法分析了混沌伪随机序列的复杂度演变特性,计算了离散混沌系统不同初值和不同系统参数条件下的复杂度.研究表明,谱熵算法能有效地分析混沌伪随机序列的结构复杂度;在这三个混沌系统中,TD-ERCS系统为广域高复杂度混沌系统,复杂度性能最好;不同窗口和不同初值条件下的混沌系统复杂度在较小范围内波动.为混沌序列在信息安全中的应用提供了理论和实验依据.     

Nonextensivity at the edge of chaos of a new universality class of one-dimensional unimodal dissipative maps

We introduce a new universality class of one-dimensional unimodal dissipative maps. The new family, from now on referred to as the (z₁, z₂)-logarithmic map, corresponds to a generalization of the z-logistic map. The Feigenbaum-like constants of these maps are determined. It has been recently shown that the probability density of sums of iterates at the edge of chaos of the z-logistic map is numerically consistent with a q-Gaussian, the distribution which, under appropriate constraints, optimizes the nonadditive entropy S_q. We focus here on the presently generalized maps to check whether they constitute a new universality class with regard to q-Gaussian attractor distributions. We also study the generalized q-entropy production per unit time on the new unimodal dissipative maps, both for strong and weak chaotic cases. The q-sensitivity indices are obtained as well. Our results are, like those for the z-logistic maps, numerically compatible with the q-generalization of a Pesin-like identity for ensemble averages.