Synchronization and Pattern Dynamics of Coupled Chaotic Maps on Complex Networks

The synchronization and pattern dynamics of coupled logistic maps on a certain type of complex network, constructed by adding random shortcuts to a regular ring, is investigated. For parameters where an isolated map is fully chaotic, the defect turbulence, which is dominant in the regular network, can be tamed into ordered periodic patterns or synchronized chaotic states when random shortcuts are added, and the patterns formed on the complex network can be grouped into two or three branches depending on the coupling strength.     

Chaotic transition of random dynamical systems and chaos synchronization by common noises

We studied the mechanism behind the connection between the transition to chaos of random dynamical systems and the synchronization of chaotic maps driven by external common noises. Near the chaotic transition, the spatial size of random dynamical systems shows an extreme intermittent behavior. By calculating the scaling exponents, we have found that the origin of this intermittent behavior is on-off intermittency. This led us to conclude that chaotic transitions through on-off intermittency can be regarded as a route for random dynamical systems. To clarify this argument, a two-dimensional random dynamical system and two coupled logistic maps driven by external common noises were analyzed.     

Exact solutions to chaotic and stochastic systems

We investigate functions that are exact solutions to chaotic dynamical systems. A generalization of these functions can produce truly random numbers. For the first time, we present solutions to random maps. This allows us to check, analytically, some recent results about the complexity of random dynamical systems. We confirm the result that a negative Lyapunov exponent does not imply predictability in random systems. We test the effectiveness of forecasting methods in distinguishing between chaotic and random time series. Using the explicit random functions, we can give explicit analytical formulas for the output signal in some systems with stochastic resonance. We study the influence of chaos on the stochastic resonance. We show, theoretically, the existence of a new type of solitonic stochastic resonance, where the shape of the kink is crucial. Using our models we can predict specific patterns in the output signal of stochastic resonance systems. (c) 2001 American Institute of Physics.     

Digital image watermarking using gyrator transform and chaotic maps

We propose a new method for digital image watermarking using gyrator transform and chaotic maps. Four chaotic maps have been used in the proposed technique. The four chaotic maps that have been used are the logistic map, the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. A new technique has been proposed to generate the single chaotic random phase mask by using two chaotic maps together with different seed values. The watermark encoding method in the proposed technique is based on the double random phase encoding method. The gyrator transform and two chaotic random phase masks are used to encode the input image. The mean square error, the peak signal-to-noise ratio and the bit error rate have been calculated. Robustness of the proposed technique has been evaluated in terms of the chaotic maps, the number of the chaotic maps used to generate the CRPM, the rotation angle of the gyrator transform and the seed values of the chaotic random phase masks. Optical implementation of the technique has been proposed. The computer simulations are presented to verify the validity of the proposed technique.     

Double-image encryption based on discrete fractional random transform and chaotic maps

A novel double-image encryption algorithm is proposed, based on discrete fractional random transform and chaotic maps. The random matrices used in the discrete fractional random transform are generated by using a chaotic map. One of the two original images is scrambled by using another chaotic map, and then encoded into the phase of a complex matrix with the other original image as its amplitude. Then this complex matrix is encrypted by the discrete fractional random transform. By applying the correct keys which consist of initial values, control parameters, and truncated positions of the chaotic maps, and fractional orders, the two original images can be recovered without cross-talk. Numerical simulation has been performed to test the validity and the security of the proposed encryption algorithm. Encrypting two images together by this algorithm creates only one encrypted image, whereas other single-image encryption methods create two encrypted images. Furthermore, this algorithm requires neither the use of phase keys nor the use of matrix keys. In this sense, this algorithm can raise the efficiency when encrypting, storing or transmitting.     

A novel scheme for image encryption based on 2D piecewise chaotic maps

In this paper, a hierarchy of two-dimensional piecewise nonlinear chaotic maps with an invariant measure is introduced. These maps have interesting features such as invariant measure, ergodicity and the possibility of K-S entropy calculation. Then by using significant properties of these chaotic maps such as ergodicity, sensitivity to initial condition and control parameter, one-way computation and random like behavior, we present a new scheme for image encryption. Based on all analysis and experimental results, it can be concluded that, this scheme is efficient, practicable and reliable, with high potential to be adopted for network security and secure communications. Although the two-dimensional piecewise nonlinear chaotic maps presented in this paper aims at image encryption, it is not just limited to this area and can be widely applied in other information security fields.     

Randomly chosen chaotic maps can give rise to nearly ordered behavior

Parrondo’s paradox [J.M.R. Parrondo, G.P. Harmer, D. Abbott, New paradoxical games based on Brownian ratchets, Phys. Rev. Lett. 85 (2000), 5226–5229] (see also [O.E. Percus, J.K. Percus, Can two wrongs make a right? Coin-tossing games and Parrondo’s paradox, Math. Intelligencer 24 (3) (2002) 68–72]) states that two losing gambling games when combined one after the other (either deterministically or randomly) can result in a winning game: that is, a losing game followed by a losing game = a winning game. Inspired by this paradox, a recent study [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] asked an analogous question in discrete time dynamical system: can two chaotic systems give rise to order, namely can they be combined into another dynamical system which does not behave chaotically? Numerical evidence is provided in [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] that two chaotic quadratic maps, when composed with each other, create a new dynamical system which has a stable period orbit. The question of what happens in the case of random composition of maps is posed in [J. Almeida, D. Peralta-Salas, M. Romera, Can two chaotic systems give rise to order? Physica D 200 (2005) 124–132] but left unanswered. In this note we present an example of a dynamical system where, at each iteration, a map is chosen in a probabilistic manner from a collection of chaotic maps. The resulting random map is proved to have an infinite absolutely continuous invariant measure (acim) with spikes at two points. From this we show that the dynamics behaves in a nearly ordered manner. When the foregoing maps are applied one after the other, deterministically as in [O.E. Percus, J.K. Percus, Can two wrongs make a right? Coin-tossing games and Parrondo’s paradox, Math. Intelligencer 24 (3) (2002) 68–72], the resulting composed map has a periodic orbit which is stable.     

Chaotic Eigenfunctions in Phase Space

We study individual eigenstates of quantized area-preserving maps on the 2-torus which are classically chaotic. In order to analyze their semiclassical behavior, we use the Bargmann–Husimi representations for quantum states as well as their stellar parametrization, which encodes states through a minimal set of points in phase space (the constellation of zeros of the Husimi density). We rigorously prove that a semiclassical uniform distribution of Husimi densities on the torus entails a similar equidistribution for the corresponding constellations. We deduce from this property a universal behavior for the phase patterns of chaotic Bargmann eigenfunctions which is reminiscent of the WKB approximation for eigenstates of integrable systems (though in a weaker sense). In order to obtain more precise information on chaotic eigenconstellations, we then model their properties by ensembles of random states, generalizing former results on the 2-sphere to the torus geometry. This approach yields statistical predictions for the constellations which fit quite well the chaotic data. We finally observe that specific dynamical information, e.g., the presence of high peaks (like scars) in Husimi densities, can be recovered from the knowledge of a few long-wavelength Fourier coefficients, which therefore appear as valuable order parameters at the level of individual chaotic eigenfunctions.     

时空混沌中的序图样研究

通过分段单调映射和线性耦合研究时空混沌中的序图样.理论分析发现,混沌映射的时不变性质导致映射曲线交点减少,为序图样缺失的一个重要原因.证明了线性耦合可以破坏映射的时不变性质,并给出曲线交点增加的条件.分析了耦合系统的映射、耦合系数和耦合次数对序图样的影响,并以实例和仿真实验验证了上述理论结果.     

Random delays and the synchronization of chaotic maps

We investigate the dynamics of an array of chaotic logistic maps coupled with random delay times. We report that for adequate coupling strength the array is able to synchronize, in spite of the random delays. Specifically, we find that the synchronized state is a homogeneous steady state, where the chaotic dynamics of the individual maps is suppressed. This synchronization behavior is largely independent of the connection topology and depends mainly on the average number of links per node. We carry out a statistical linear stability analysis that confirms the numerical results and provides a better understanding of the nontrivial roles of random delayed interactions.     

一个全局耦合不连续映像格子中的冻结化随机图案模式

本文研究了一类既不连续又不可逆分段线性映像构成的全局耦合映像格子系统中的一类典型集体动力学行为, 即冻结化随机图案模式. 计算了平均同步序参量和最大李雅普诺夫指数随耦合强度的变化. 结果显示, 当耦合强度超过某个阈值后, 在给定动力学变量的初始下, 系统几乎都能达到完全或部分同步状态, 出现冻结化随机图案. 这些现象表明, 耦合映像格子系统中存在着多个共存的吸引子. 因此, 其冻结化图案的结构和分布敏感地依赖于格点动力学变量初始值的选取. 感兴趣地是, 即使当单映像处于混沌状态时, 格点间的耦合仍能将系统调制到规则的运动状态, 这种特征对于混沌控制具有重要的利用价值. 上述丰富动力学行为的出现是由于单映像中不连续性和不可逆性相互作用的结果.     

基于多混沌系统的双图像光学加密算法

为了扩展双图像光学加密算法的密钥空间,克服双随机相位加密系统中随机相位掩模作为密钥难于存储、传输和重构的问题,突破传统图像加密的研究思路,提出了一种基于多混沌系统的双图像加密算法,构造了光学加密系统。系统增加混沌系统参数作为密钥,利用混沌加密密钥空间大和图像置乱隐藏性好的特点,构建基于Logistic混沌映射的图像置乱算法,利用Kent混沌映射生成的伪随机序列构造出一对随机相位掩模,分别放置在分数傅里叶变换光学装置的两端,图像经加密系统变换后得到密文。数值仿真结果表明,算法的密钥敏感性极高,能够有效地对抗统计攻击,具有较高的安全性。     

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).     

A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.     

Hierarchy of rational order families of chaotic maps with an invariant measure

We introduce an interesting hierarchy of rational order chaotic maps that possess an invariant measure. In contrast to the previously introduced hierarchy of chaotic maps [1–5], with merely entropy production, the rational order chaotic maps can simultaneously produce and consume entropy. We compute the Kolmogorov-Sinai entropy of these maps analytically and also their Lyapunov exponent numerically, where the obtained numerical results support the analytical calculations.     

How efficiently Do three pointlike particles sample phase space?

We show that the continuous phase space of a hard particle system can be mapped onto a discrete but infinite phase space. For three pointlike particles confined to a ring, the evolution of the system maps onto a chaotic walk on a hexagonal lattice. This facilitates direct measurement of the departure of the system from its original configuration. In special cases of mass ratios the phase space becomes closed and finite (nonergodic). There are qualitative differences between this chaotic walk and a random walk, in particular a more rapid sampling of phase space.     

Using chaos to produce synchronized stochastic dynamics in non-homogeneous map arrays with a random scalar coupling

Unidirectionally coupled chaotic systems hold great interest from the information processing and communications perspective. In this Letter, we report on a novel method for synchronizing two identical but internally non-homogeneous populations of chaotic maps using a scalar random coupling between them. The resulting synchronized dynamics is stochastic, and can be used in secure multi-user communication applications.     

Chaos based multiple image encryption using multiple canonical transforms

We propose a new method for multiple image encryption using linear canonical transforms and chaotic maps. Three linear canonical transforms and three chaotic maps are used in the proposed technique. The three linear canonical transforms that have been used are the fractional Fourier transform, the extended fractional Fourier transform and the Fresnel transform. The three chaotic maps that have been used are the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. The mean square error and the signal to noise ratio have been calculated. Robustness of the proposed technique to blind decryption has been evaluated. Optical implementation of the technique has been proposed. Experimental and simulations results are presented to verify the validity of the proposed technique.     

Ordering chaos by random shortcuts

In this Letter, the effects of random shortcuts in an array of coupled nonlinear chaotic pendulums and their ability to control the dynamical behavior of the system are investigated. We show that random shortcuts can induce periodic synchronized spatiotemporal motions, even though all oscillators are chaotic when uncoupled. This process exhibits a nonmonotonic dependence on the density of shortcuts. Specifically, there is an optimal amount of random shortcuts, which can induce the most ordered motion characterized by the largest order parameter that is introduced to measure the spatiotemporal order. Our results imply that topological randomness can tame spatiotemporal chaos.     

耦合不连续系统同步转换过程中的多吸引子共存

本文研究了耦合不连续系统的同步转换过程中的动力学行为, 发现由混沌非同步到混沌同步的转换过程中特殊的多吸引子共存现象. 通过计算耦合不连续系统的同步序参量和最大李雅普诺夫指数随耦合强度的变化, 发现了较复杂的同步转换过程: 临界耦合强度之后出现周期非同步态(周期性窗口); 分析了系统周期态的迭代轨道,发现其具有两类不同的迭代轨道: 对称周期轨道和非对称周期轨道, 这两类周期吸引子和同步吸引子同时存在, 系统表现出对初值敏感的多吸引子共存现象. 分析表明, 耦合不连续系统中的周期轨道是由于局部动力学的不连续特性和耦合动力学相互作用的结果. 最后, 对耦合不连续系统的同步转换过程进行了详细的分析, 结果表明其同步呈现出较复杂的转换过程.