Random Coupling of Chaotic Maps Leads to Spatiotemporal Synchronization

Total Page:16

File Type:pdf, Size:1020Kb

Random Coupling of Chaotic Maps Leads to Spatiotemporal Synchronization PHYSICAL REVIEW E 66, 016209 ͑2002͒ Random coupling of chaotic maps leads to spatiotemporal synchronization Sudeshna Sinha* Institute of Mathematical Sciences, Taramani, Chennai 600 113, India ͑Received 8 March 2002; published 18 July 2002͒ We investigate the spatiotemporal dynamics of a network of coupled chaotic maps, with varying degrees of randomness in coupling connections. While strictly nearest neighbor coupling never allows spatiotemporal synchronization in our system, randomly rewiring some of those connections stabilizes entire networks at x*, where x* is the strongly unstable fixed point solution of the local chaotic map. In fact, the smallest degree of randomness in spatial connections opens up a window of stability for the synchronized fixed point in coupling ⑀ parameter space. Further, the coupling bifr at which the onset of spatiotemporal synchronization occurs, scales with the fraction of rewired sites p as a power law, for 0.1ϽpϽ1. We also show that the regularizing effect of random connections can be understood from stability analysis of the probabilistic evolution equation for the ⑀ system, and approximate analytical expressions for the range and bifr are obtained. DOI: 10.1103/PhysRevE.66.016209 PACS number͑s͒: 05.45.Ra, 05.45.Xt I. INTRODUCTION is chosen to be the fully chaotic logistic map, f (x)ϭ4x(1 Ϫx). This map has widespread relevance as a prototype of The coupled map lattice ͑CML͒ was introduced as a low dimensional chaos. simple model capturing the essential features of nonlinear Now we will consider the above system with its coupling dynamics of extended systems ͓1͔. Over the past decade re- connections rewired randomly in varying degrees, and try to search centered around CML has yielded suggestive concep- determine what dynamical properties are significantly af- tual models of spatiotemporal phenomena, in fields ranging fected by the way connections are made between elements. from biology to engineering. In particular, this class of sys- In our study, at every update we will connect a fraction p of tems is of considerable interest in modeling phenomena as randomly chosen sites in the lattice, to two other random diverse as Josephson junction arrays, multimode lasers, vor- sites, instead of their nearest neighbors as in Eq. ͑1͒. That is, tex dynamics, and even evolutionary biology. The ubiquity we will replace a fraction p of nearest neighbor links by of distributed complex systems has made the CML a focus of random connections. The case of pϭ0 corresponds to the sustained research interest. usual nearest neighbor interaction, while pϭ1 corresponds A very well studied coupling form in CMLs is nearest to completely random coupling ͓2–7͔. neighbor coupling. While this regular network is the chosen This scenario is much like small world networks at low p, topology of innumerable studies, there are strong reasons to namely, pϳ0.01. Note, however, that we explore the full revisit this fundamental issue in the light of the fact that range of p here. In our work 0рpр1. So the study is inclu- some degree of randomness in spatial coupling can be closer sive of, but not confined to, small world networks. to physical reality than strict nearest neighbor scenarios. In fact, many systems of biological, technological, and physical significance are better described by randomizing some frac- II. NUMERICAL RESULTS tion of the regular links ͓2–7͔. So here we will study the We will now present numerical evidence that random re- spatiotemporal dynamics of CMLs with some of its coupling wiring has a pronounced effect on spatiotemporal synchroni- connections rewired randomly, i.e., an extended system com- zation. The numerical results here have been obtained by prized of a collection of elemental dynamical units with sampling a large set of random initial conditions (ϳ104), varying degrees of randomness in its spatial connections. and with lattice sizes ranging from 10 to 1000. Specifically, we consider a one-dimensional ring of Figures 1 and 2 display the state of the network, xn(i), coupled logistic maps. The sites are denoted by integers i iϭ1,..., N, with respect to coupling strength ⑀, for the limit- ϭ1,...,N, where N is the linear size of the lattice. On each ing cases of nearest neighbor interactions ͑i.e., pϭ0͒ and site is defined a continuous state variable denoted by xn(i), completely random coupling ͑i.e., pϭ1͒. It is clearly seen which corresponds to the physical variable of interest. The that the standard nearest neighbor coupling does not yield a evolution of this lattice, under standard nearest neighbor in- spatiotemporal fixed point anywhere in the entire coupling teractions, in discrete time n is given by range 0р⑀р1 ͓8͔. Now the effect of introducing some random connections, ⑀ i.e., pϾ0, is to create windows in parameter space where a x ϩ ͑i͒ϭ͑1Ϫ⑀͒f ͓x ͑i͔͒ϩ ͕x ͑iϩ1͒ϩx ͑iϪ1͖͒. n 1 n 2 n n spatiotemporal fixed point state gains stability, i.e., where ͑ ͒ ϭ ϭ 1 one finds all lattice sites synchronized at xn(i) x* 3/4, for all sites i and at all times n. Note that x*ϭ f (x*) is the fixed The strength of coupling is given by ⑀. The local on-site map point solution of the individual chaotic maps, and is strongly unstable in the local chaotic map. We then have for all p Ͼ0, a stable region of synchronized fixed points in the pa- ⑀ р⑀р ⑀ *Email address: [email protected] rameter interval, bifr 1.0. The value of bifr , where the 1063-651X/2002/66͑1͒/016209͑6͒/$20.0066 016209-1 ©2002 The American Physical Society SUDESHNA SINHA PHYSICAL REVIEW E 66, 016209 ͑2002͒ FIG. 1. Bifurcation diagram showing values of xn(i) with re- spect to coupling strength ⑀, for coupled logistic maps with strictly regular nearest neighbor connections. Here the linear size of the ϭ ϭ lattice is N 100 and in the figure we plot xn(i)(i 1,...,100) over nϭ1,...,5 iterations ͑after a transience time of 1000͒ for five differ- ent initial conditions. FIG. 3. The stable range R with respect to the fraction of ran- domly rewired sites p (0.001рpр1). The solid line displays the analytical result of Eq. ͑7͒, and the different points are obtained spatiotemporally invariant state onsets, is dependent on p.It from numerical simulations over several different initial conditions, ⑀ is evident from Fig. 2 that bifr for completely random cou- for four different lattice sizes, namely, Nϭ10, 50, 100, and 500. pling pϭ1 is around 0.62. The dotted line shows Rϭp, and it is clear that for a large range of The relationship between the fraction of rewired connec- p the approximation holds. Rϭ Ϫ⑀ tions p and the range, (1 bifr), within which spa- tiotemporal homogeniety is obtained, is displayed in Fig. 3. It is clearly evident that unlike nearest neighbor coupling, random coupling leads to large parameter regimes of regular homogeneous behavior, with all lattice sites synchronized exactly at x(i)ϭx*ϭ0.75. Furthermore, the synchronized spatiotemporal fixed point gains stability over some finite parameter range under any finite p, i.e., whenever pϾ0, however small, we have RϾ0. In that sense strictly nearest neighbor coupling is singular as it does not support spa- tiotemporal synchronization anywhere in coupling parameter ⑀ ͑ FIG. 4. The bifr i.e., the value of coupling at which the onset of spatiotemporal synchronization occurs͒ with respect to fraction of randomly rewired sites p (0.001рpр1). The solid line displays the ͑ ͒ FIG. 2. Bifurcation diagram showing values of xn(i) with re- analytical result of Eq. 6 , and the points are obtained from nu- spect to coupling strength ⑀, for coupled logistic maps with com- merical simulations over several different initial conditions, for four pletely random connections. Here the linear size of the lattice is different lattice sizes, namely, Nϭ10, 50, 100, and 500. The inset ϭ ϭ Ͻ р N 100 and in the figure we plot xn(i)(i 1,...,100) over n box shows a blow up of 0.1 p 1. Here the numerically obtained ϭ ͑ ͒ ⑀ 1,...,5 iterations after a transience time of 1000 for five different bifr deviates from the mean field results. The dashed line is the best initial conditions. fit straight line for the numerically obtained points in that region. 016209-2 RANDOM COUPLING OF CHAOTIC MAPS LEADS TO . PHYSICAL REVIEW E 66, 016209 ͑2002͒ space, whereas any degree of randomness in spatial coupling ⑀ h ϩ ͑ j͒ϭ͑1Ϫ⑀͒f Ј͑x*͒h ͑ j͒ϩ͑1Ϫp͒ ͕h ͑ jϩ1͒ connections opens up a synchronized fixed point window. n 1 n 2 n Thus random connections yield spatiotemporal homogeneity here, while completely regular connections never do. ⑀ ϩ ͑ Ϫ ͖͒ϩ ͕ ͑␰͒ϩ ͑␩͖͒ ⑀ hn j 1 p hn hn The relationship between bifr , the point of onset of the 2 spatiotemporal fixed phase, and p is shown in Fig. 4. Note Ͻ ⑀ ⑀ that for p 0.1 random rewiring does not affect bifr much. Ϸ͑1Ϫ⑀͒f Ј͑x*͒h ͑ j͒ϩ͑1Ϫp͒ ͕h ͑ jϩ1͒ ϳ ⑀ n n Only after p 0.1 does bifr fall appreciably. Further, it is 2 clearly evident that for 0.1Ͻpр1 the lower end of the sta- ϩh ͑ jϪ1͖͒, ͑3͒ bility range falls with increasing p as a well defined power n ⑀ law. Note that lattice size has very little effect on bifr , and ⑀ as to a first approximation one can consider the sum over the the numerically obtained bifr for ensembles of initial random fluctuations of the random neighbors to be zero. This ap- ϭ initial conditions over a range of lattice sizes N 10, 50, 100, proximation is clearly more valid for small p. and 500 fall quite indistinguishably around each other.
Recommended publications
  • A General Representation of Dynamical Systems for Reservoir Computing
    A general representation of dynamical systems for reservoir computing Sidney Pontes-Filho∗,y,x, Anis Yazidi∗, Jianhua Zhang∗, Hugo Hammer∗, Gustavo B. M. Mello∗, Ioanna Sandvigz, Gunnar Tuftey and Stefano Nichele∗ ∗Department of Computer Science, Oslo Metropolitan University, Oslo, Norway yDepartment of Computer Science, Norwegian University of Science and Technology, Trondheim, Norway zDepartment of Neuromedicine and Movement Science, Norwegian University of Science and Technology, Trondheim, Norway Email: [email protected] Abstract—Dynamical systems are capable of performing com- TABLE I putation in a reservoir computing paradigm. This paper presents EXAMPLES OF DYNAMICAL SYSTEMS. a general representation of these systems as an artificial neural network (ANN). Initially, we implement the simplest dynamical Dynamical system State Time Connectivity system, a cellular automaton. The mathematical fundamentals be- Cellular automata Discrete Discrete Regular hind an ANN are maintained, but the weights of the connections Coupled map lattice Continuous Discrete Regular and the activation function are adjusted to work as an update Random Boolean network Discrete Discrete Random rule in the context of cellular automata. The advantages of such Echo state network Continuous Discrete Random implementation are its usage on specialized and optimized deep Liquid state machine Discrete Continuous Random learning libraries, the capabilities to generalize it to other types of networks and the possibility to evolve cellular automata and other dynamical systems in terms of connectivity, update and learning rules. Our implementation of cellular automata constitutes an reservoirs [6], [7]. Other systems can also exhibit the same initial step towards a general framework for dynamical systems. dynamics. The coupled map lattice [8] is very similar to It aims to evolve such systems to optimize their usage in reservoir CA, the only exception is that the coupled map lattice has computing and to model physical computing substrates.
    [Show full text]
  • Thermodynamic Properties of Coupled Map Lattices 1 Introduction
    Thermodynamic properties of coupled map lattices J´erˆome Losson and Michael C. Mackey Abstract This chapter presents an overview of the literature which deals with appli- cations of models framed as coupled map lattices (CML’s), and some recent results on the spectral properties of the transfer operators induced by various deterministic and stochastic CML’s. These operators (one of which is the well- known Perron-Frobenius operator) govern the temporal evolution of ensemble statistics. As such, they lie at the heart of any thermodynamic description of CML’s, and they provide some interesting insight into the origins of nontrivial collective behavior in these models. 1 Introduction This chapter describes the statistical properties of networks of chaotic, interacting el- ements, whose evolution in time is discrete. Such systems can be profitably modeled by networks of coupled iterative maps, usually referred to as coupled map lattices (CML’s for short). The description of CML’s has been the subject of intense scrutiny in the past decade, and most (though by no means all) investigations have been pri- marily numerical rather than analytical. Investigators have often been concerned with the statistical properties of CML’s, because a deterministic description of the motion of all the individual elements of the lattice is either out of reach or uninteresting, un- less the behavior can somehow be described with a few degrees of freedom. However there is still no consistent framework, analogous to equilibrium statistical mechanics, within which one can describe the probabilistic properties of CML’s possessing a large but finite number of elements.
    [Show full text]
  • A Simple Scalar Coupled Map Lattice Model for Excitable Media
    This is a repository copy of A simple scalar coupled map lattice model for excitable media. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74667/ Monograph: Guo, Y., Zhao, Y., Coca, D. et al. (1 more author) (2010) A simple scalar coupled map lattice model for excitable media. Research Report. ACSE Research Report no. 1016 . Automatic Control and Systems Engineering, University of Sheffield Reuse Unless indicated otherwise, fulltext items are protected by copyright with all rights reserved. The copyright exception in section 29 of the Copyright, Designs and Patents Act 1988 allows the making of a single copy solely for the purpose of non-commercial research or private study within the limits of fair dealing. The publisher or other rights-holder may allow further reproduction and re-use of this version - refer to the White Rose Research Online record for this item. Where records identify the publisher as the copyright holder, users can verify any specific terms of use on the publisher’s website. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ A Simple Scalar Coupled Map Lattice Model for Excitable Media Yuzhu Guo, Yifan Zhao, Daniel Coca, and S. A. Billings Research Report No. 1016 Department of Automatic Control and Systems Engineering The University of Sheffield Mappin Street, Sheffield, S1 3JD, UK 8 September 2010 A Simple Scalar Coupled Map Lattice Model for Excitable Media Yuzhu Guo, Yifan Zhao, Daniel Coca, and S.A.
    [Show full text]
  • Coupled Map Lattice (CML) Approach
    Different mechanisms of synchronization : Coupled Map Lattice (CML) approach – p.1 Outline Synchronization : an universal phenomena Model (Coupled maps/oscillators on Networks) – p.2 Modelling Spatio-temporal dynamics 2- and 3-dimensional fluid flow, Coupled-oscillator models, Cellular automata, Transport models, Coupled map models Model does not have direct connections with actual physical or biological systems – p.3 Modelling Spatio-temporal dynamics 2- and 3-dimensional fluid flow, Coupled-oscillator models, Cellular automata, Transport models, Coupled map models Model does not have direct connections with actual physical or biological systems General results show some universal features – p.3 We select coupled maps(chaotic), oscillators on Networks Models. – p.4 Coupled Dynamics on Networks ε xi(t +1) = f(xi(t)) + Cijg(xi(t),xj(t)) Cij Pj P Periodic orbit Synchronized chaos Travelling wave Spatio-temporal chaos – p.5 Coupled maps Models Coupled oscillators (- Kuramoto ∼ beginning of 1980’s) Coupled maps (- K. Kaneko) - K. Kaneko, ”Simulating Physics with Coupled Map Lattices —— Pattern Dynamics, Information Flow, and Thermodynamics of Spatiotemporal Chaos”, pp1-52 in Formation, Dynamics, and Statistics of Patterns ed. K. Kawasaki et.al., World. Sci. 1990” – p.6 Studying real systems with coupled maps/oscillators models: - Ott, Kurths, Strogatz, Geisel, Mikhailov, Wolf etc . From Kuramoto to Crawford .... (Physica D, Sep 2000) Chaotic Transients in Complex Networks, (Phys Rev Lett, 2004) Turbulence in oscillatory chemical reactions, (J Chem Phys, 1994) Crowd synchrony on the Millennium Bridge, (Nature, 2005) Species extinction - Amritkar and Rangarajan, Phys. Rev. Lett. (2006) – p.7 SYNCHRONIZATION First observation (Pendulum clock (1665)) - discovered in 1665 by the famous Dutch physicists, Christiaan Huygenes.
    [Show full text]
  • Predictability: a Way to Characterize Complexity
    Predictability: a way to characterize Complexity G.Boffetta (a), M. Cencini (b,c), M. Falcioni(c), and A. Vulpiani (c) (a) Dipartimento di Fisica Generale, Universit`adi Torino, Via Pietro Giuria 1, I-10125 Torino, Italy and Istituto Nazionale Fisica della Materia, Unit`adell’Universit`adi Torino (b) Max-Planck-Institut f¨ur Physik komplexer Systeme, N¨othnitzer Str. 38 , 01187 Dresden, Germany (c) Dipartimento di Fisica, Universit`adi Roma ”la Sapienza”, Piazzale Aldo Moro 5, 00185 Roma, Italy and Istituto Nazionale Fisica della Materia, Unit`adi Roma 1 Contents 1 Introduction 4 2 Two points of view 6 2.1 Dynamical systems approach 6 2.2 Information theory approach 11 2.3 Algorithmic complexity and Lyapunov Exponent 18 3 Limits of the Lyapunov exponent for predictability 21 3.1 Characterization of finite-time fluctuations 21 3.2 Renyi entropies 25 3.3 The effects of intermittency on predictability 26 3.4 Growth of non infinitesimal perturbations 28 arXiv:nlin/0101029v1 [nlin.CD] 17 Jan 2001 3.5 The ǫ-entropy 32 4 Predictability in extended systems 34 4.1 Simplified models for extended systems and the thermodynamic limit 35 4.2 Overview on the predictability problem in extended systems 37 4.3 Butterfly effect in coupled map lattices 39 4.4 Comoving and Specific Lyapunov Exponents 41 4.5 Convective chaos and spatial complexity 42 4.6 Space-time evolution of localized perturbations 46 4.7 Macroscopic chaos in Globally Coupled Maps 49 Preprint submitted to Elsevier Preprint 30 April 2018 4.8 Predictability in presence of coherent structures 51 5
    [Show full text]
  • A Robust Image-Based Cryptology Scheme Based on Cellular Non-Linear Network and Local Image Descriptors
    PRE-PRINT IJPEDS A robust image-based cryptology scheme based on cellular non-linear network and local image descriptors Mohammad Mahdi Dehshibia, Jamshid Shanbehzadehb, and Mir Mohsen Pedramb aDepartment of Computer Engineering, Faculty of Computer and Electrical Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran; bDepartment of Electrical and Computer Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran ARTICLE HISTORY Compiled August 14, 2018 ABSTRACT Cellular nonlinear network (CNN) provides an infrastructure for Cellular Automata to have not only an initial state but an input which has a local memory in each cell with much more complexity. This property has many applications which we have investigated it in proposing a robust cryptology scheme. This scheme consists of a cryptography and steganography sub-module in which a 3D CNN is designed to produce a chaotic map as the kernel of the system to preserve confidentiality and data integrity in cryptology. Our contributions are three-fold including (1) a feature descriptor is applied to the cover image to form the secret key while conventional methods use a predefined key, (2) a 3D CNN is used to make a chaotic map for making cipher from the visual message, and (3) the proposed CNN is also used to make a dynamic k-LSB steganography. Conducted experiments on 25 standard images prove the effectiveness of the proposed cryptology scheme in terms of security, visual, and complexity analysis. KEYWORDS Cryptography; Steganography; Chaotic map; Cellular Non-linear Network; Image Descriptor; Complexity 1. Introduction Sensitive and personal data are parts of data transmission over the Internet which have always been suspicious to be intercepted.
    [Show full text]
  • SPATIOTEMPORAL CHAOS in COUPLED MAP LATTICE Itishree
    SPATIOTEMPORAL CHAOS IN COUPLED MAP LATTICE By Itishree Priyadarshini Under the Guidance of Prof. Biplab Ganguli Department of Physics National Institute of Technology, Rourkela CERTIFICATE This is to certify that the project thesis entitled ” Spatiotemporal chaos in Cou- pled Map Lattice ” being submitted by Itishree Priyadarshini in partial fulfilment to the requirement of the one year project course (PH 592) of MSc Degree in physics of National Institute of Technology, Rourkela has been carried out under my super- vision. The result incorporated in the thesis has been produced by developing her own computer codes. Prof. Biplab Ganguli Dept. of Physics National Institute of Technology Rourkela - 769008 1 ACKNOWLEDGEMENT I would like to acknowledge my guide Prof. Biplab Ganguli for his help and guidance in the completion of my one-year project and also for his enormous moti- vation and encouragement. I am also very much thankful to research scholars whose encouragement and support helped me to complete my project. 2 ABSTRACT The sensitive dependence on initial condition, which is the essential feature of chaos is demonstrated through simple Lorenz model. Period doubling route to chaos is shown by analysis of Logistic map and other different route to chaos is discussed. Coupled map lattices are investigated as a model for spatio-temporal chaos. Diffusively coupled logistic lattice is studied which shows different pattern in accordance with the coupling constant and the non-linear parameter i.e. frozen random pattern, pattern selection with suppression of chaos , Brownian motion of the space defect, intermittent collapse, soliton turbulence and travelling waves. 3 Contents 1 Introduction 3 2 Chaos 3 3 Lorenz System 4 4 Route to Chaos 6 4.1 PeriodDoubling.............................
    [Show full text]
  • Analysis of the Coupled Logistic Map
    Theoretical Population Biology TP1365 Theoretical Population Biology 54, 1137 (1998) Article No. TP981365 Spatial Structure, Environmental Heterogeneity, and Population Dynamics: Analysis of the Coupled Logistic Map Bruce E. Kendall* Department of Ecology and Evolutionary Biology, University of Arizona, Tucson, Arizona 85721, and National Center for Ecological Analysis and Synthesis, University of California, Santa Barbara, California 93106 and Gordon A. Fox- Department of Biology 0116, University of California San Diego, 9500 Gilman Drive, La Jolla, California 92093-0116, and Department of Biology, San Diego State University, San Diego, California 92182 Spatial extent can have two important consequences for population dynamics: It can generate spatial structure, in which individuals interact more intensely with neighbors than with more distant conspecifics, and it allows for environmental heterogeneity, in which habitat quality varies spatially. Studies of these features are difficult to interpret because the models are complex and sometimes idiosyncratic. Here we analyze one of the simplest possible spatial population models, to understand the mathematical basis for the observed patterns: two patches coupled by dispersal, with dynamics in each patch governed by the logistic map. With suitable choices of parameters, this model can represent spatial structure, environmental heterogeneity, or both in combination. We synthesize previous work and new analyses on this model, with two goals: to provide a comprehensive baseline to aid our understanding of more complex spatial models, and to generate predictions about the effects of spatial structure and environmental heterogeneity on population dynamics. Spatial structure alone can generate positive, negative, or zero spatial correlations between patches when dispersal rates are high, medium, or low relative to the complexity of the local dynamics.
    [Show full text]
  • Novel Coupling Scheme to Control Dynamics of Coupled Discrete Systems
    Novel coupling scheme to control dynamics of coupled discrete systems Snehal M. Shekatkar, G. Ambika1 Indian Institute of Science Education and Research, Pune 411008, India Abstract We present a new coupling scheme to control spatio-temporal patterns and chimeras on 1-d and 2-d lattices and random networks of discrete dynamical systems. The scheme involves coupling with an external lattice or network of damped systems. When the system network and external network are set in a feedback loop, the system network can be controlled to a homogeneous steady state or synchronized periodic state with suppression of the chaotic dynamics of the individual units. The control scheme has the advantage that its design does not require any prior information about the system dynamics or its parameters and works effectively for a range of parameters of the control network. We analyze the stability of the controlled steady state or amplitude death state of lattices using the theory of circulant matrices and Routh-Hurwitz’s criterion for discrete systems and this helps to isolate regions of effective control in the relevant parameter planes. The conditions thus obtained are found to agree well with those obtained from direct numerical simulations in the specific context of lattices with logistic map and Henon map as on-site system dynamics. We show how chimera states developed in an experimentally realizable 2-d lattice can be controlled using this scheme. We propose this mechanism can provide a phenomenological model for the control of spatio-temporal patterns in coupled neurons due to non-synaptic coupling with the extra cellular medium.
    [Show full text]
  • Coupled Logistic Maps and Non-Linear Differential Equations
    Coupled logistic maps and non-linear differential equations Eytan Katzav1 and Leticia F. Cugliandolo1,2 1Laboratoire de Physique Th´eorique de l’Ecole´ Normale Sup´erieure, 24 rue Lhomond, 75231 Paris Cedex 05, France 2Laboratoire de Physique Th´eorique et Hautes Energies,´ Jussieu, 5`eme ´etage, Tour 25, 4 Place Jussieu, 75252 Paris Cedex 05, France Abstract. We study the continuum space-time limit of a periodic one dimensional array of deterministic logistic maps coupled diffusively. First, we analyse this system in connection with a stochastic one dimensional Kardar-Parisi-Zhang (KPZ) equation for confined surface fluctuations. We compare the large-scale and long-time behaviour of space-time correlations in both systems. The dynamic structure factor of the coupled map lattice (CML) of logistic units in its deep chaotic regime and the usual d = 1 KPZ equation have a similar temporal stretched exponential relaxation. Conversely, the spatial scaling and, in particular, the size dependence are very different due to the intrinsic confinement of the fluctuations in the CML. We discuss the range of values of the non-linear parameter in the logistic map elements and the elastic coefficient coupling neighbours on the ring for which the connection with the KPZ-like equation holds. In the same spirit, we derive a continuum partial differential equation governing the evolution of the Lyapunov vector and we confirm that its space-time behaviour becomes the one of KPZ. Finally, we briefly discuss the interpretation of the continuum limit of the CML as a Fisher-Kolmogorov-Petrovsky-Piscounov (FKPP) non-linear diffusion equation with an additional KPZ non-linearity and the possibility of developing travelling wave configurations.
    [Show full text]
  • Synchronization and Periodic Windows in Globally Coupled Map Lattice
    The Fourteenth International Symposium on Artificial Life and Robotics 2009 (AROB 14th ’09), B-Con Plaza, Beppu, Oita, Japan, February 5 - 7, 2009 Synchronization and Periodic Windows in Globally Coupled Map Lattice Tokuzo Shimada, Kazuhiro Kubo, Takanobu Moriya Department of Physics, Meiji University Higashi-Mita 1-1, Kawasaki, Kanagawa 214, Japan A globally coupled map lattice (GCML) is an extension of a spin glass model. It consists of a large number of maps with a high nonlinearity and evolves iteratively under averaging interaction via their mean field. It exhibits various interesting phases under the conflict between randomness and coherence. We have found that even in its weak coupling regime, effects of the periodic windows of element maps dominate the dynamics of the system, and the system forms periodic cluster attractors. This may give a clue to the efficient pattern recognition by the brain. We analyze how the effect systematically depends on the distance from the periodic windows in the parameter space. Key words: synchronization, cluster attractors, peri- which oscillate in period p around the mean field with odicity manifestation, globally coupled maps phases (exp(2¼j=p); j = 0; 1; ¢ ¢ ¢ ; p ¡ 1). Such a MSCA is in general associated by a sequence of cluster attrac- tors; (p; c = p ¡ 1) ! (p; c = p ¡ 2) ! ¢ ¢ ¢ , which are I. INTRODUCTION produced in order with the increase of the coupling ".A basic tool to detect the GCML state is the mean square GCML devised by Kaneko [1, 2] is an unfailing source deviation of the mean field h(n) in time defined by of ideas on the behavior of a complex system composed of many chaotic elements.
    [Show full text]
  • Collective Dynamics and Homeostatic Emergence in Complex Adaptive Ecosystem
    ECAL - General Track Collective Dynamics and Homeostatic Emergence in Complex Adaptive Ecosystem Dharani Punithan and RI (Bob) McKay Structural Complexity Laboratory, College of Engineering, School of Computer Science and Engineering, Seoul National University, South Korea punithan.dharani,rimsnucse @gmail.com { } Downloaded from http://direct.mit.edu/isal/proceedings-pdf/ecal2013/25/332/1901807/978-0-262-31709-2-ch049.pdf by guest on 26 September 2021 Abstract 1. Life-environment feedback via the daisyworld model We investigate the behaviour of the daisyworld model on 2. State-topology feedback via an adaptive network model an adaptive network, comparing it to previous studies on a fixed topology grid, and a fixed small-world (Newman-Watts 3. Density-growth feedback via a logistic growth model (NW)) network. The adaptive networks eventually generate topologies with small-world effect behaving similarly to the The topology of the our ecosystem evolves with a simple NW model – and radically different from the grid world. Un- der the same parameter settings, static but complex patterns local rule – a frozen habitat is reciprocally linked to an ac- emerge in the grid world. In the NW model, we see the tive habitat – and self-organises to complex topologies with emergence of completely coherent periodic dominance. In small-world effect. In this paper, we focus on the emergent the adaptive-topology world, the systems may transit through collective phenomena and properties that arise in egalitarian varied behaviours, but can self-organise to a small-world small-world ecosystems, constructed from a large number of network structure with similar cyclic behaviour to the NW model.
    [Show full text]