DOCSLIB.ORG

Symbolic Dynamics of Coupled Map Lattices

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Symbolic Dynamics of Coupled Map Lattices PHYSICAL REVIEW LETTERS week ending PRL 96, 034105 (2006) 27 JANUARY 2006 Symbolic Dynamics of Coupled Map Lattices Shawn D. Pethel,1 Ned J. Corron,1 and Erik Bollt2 1U.S. Army Aviation and Missile Command, AMSRD-AMR-WS-ST, Redstone Arsenal, Alabama 35898, USA 2Department of Math and Computer Science, Clarkson University, Potsdam, New York 13699-5805, USA (Received 28 February 2005; published 27 January 2006) We present a method to reduce the RN dynamics of coupled map lattices (CMLs) of N invertibly coupled unimodal maps to a sequence of N-bit symbols. We claim that the symbolic description is complete and provides for the identification of all fixed points, periodic orbits, and dense orbits as well as an efficient representation for studying pattern formation in CMLs. We give our results for CMLs in terms of symbolic dynamical concepts well known for one-dimensional chaotic maps, including generating partitions, Gray orderings, and kneading sequences. An example utilizing coupled quadratic maps is given. DOI: 10.1103/PhysRevLett.96.034105 PACS numbers: 05.45.Jn, 05.45.Ra The study of complex motion is greatly simplified by I a; b and with local dynamics fi: I ! I. A typical investigating models that employ a coarse space-time dis- diffusively coupled map lattice (CML) as introduced by cretization. Such models, typified by coupled map lattices Kaneko is written as (CMLs), have been shown to reproduce the essential fea- i i iÿ1 i1 tures of turbulence in physical, chemical, and biological xn1 1 ÿ fi xn=2fiÿ1 xn fi1 xn ; systems [1]. A further simplification can be achieved by (1) considering iterates of the resulting map through a partition which reduces the chaotic motion to a purely symbolic along with rules for the boundary sites [17]. The behavior signal with associated transition rules. The study of such of the lattice with respect to the coupling parameter is of signals is called symbolic dynamics [2]. An effective state- primary interest here; the dynamics of the local maps fi are space-time discretization connects dynamical systems the- well understood. In particular, we choose f with a good ory to the study of formal languages, and hence, to com- symbolic representation. puter science, information theory, and automata [3]. Such a function can be taken from the family of uni- Symbolic dynamical methods have been studied as a pos- modal (single-humped) maps over the interval. We label sible way to understand space-time chaos [4] and have the location of the maxima as the critical point xc and recently been used [5] to bound entropy and determine divide the interval into two sets P fP0;P1g, where P0 ergodic properties of CMLs [6]. These attempts rely on a; xc and P1 xc;b. The point x0 2 I is mapped to the specially constructed CMLs or on showing that Markov semi-infinite symbol sequence x0s s0s1s2s3 ... partitions of local, uncoupled dynamics are preserved in where the presence of weak interactions [7,8]. 0 if fn x 2P ; s 0 0 (2) In this Letter we describe the symbolic dynamics due to n 1 if fn x 2P : generating partitions, which we claim exist in a much 0 1 broader class of CMLs, including those with strong cou- The critical point can be assigned either symbol. In this pling. For CMLs of N unimodal maps the implication is formulation the dynamics are characterized by a set of that evolution through the RN state space is reducible to a rules that determine which sequences are allowed by f. sequence of N-bit symbols. We conjecture that the sym- The set of allowable sequences can be related to the state bolic description is complete and provides for the rigorous space through the inverse mapping identification of all fixed points, periodic orbits, and dense \1 orbits as well as an efficient representation for studying r s fÿn P : (3) pattern formation in CMLs [9]. We also show that the sn n0 symbol ordering properties of 1D maps extend naturally to CMLs and allow the calculation of topological features For a faithful representation of chaotic dynamics, we re- without the need for extensive time series data. Impor- quire that r s converge to a single point in the interval, or tantly, the results presented here make straightforward to the null set if s is not permitted by f. A partition that the application to CMLs of symbolic dynamical methods satisfies this property is referred to as generating. Note that used recently for the targeting and control of chaos [10– for noninvertible maps fÿ1 has multiple solutions, one on 12], for probing the limits of synchronization [13], and for each monotonic segment of f. For a partition to be gen- efficient chaos communication schemes [14–16]. erating each of these branches must be uniquely labeled, We consider a map lattice with N sites labeled i otherwise points that share a common image would not be i 1; ...;N. Each site is described by a state xn in the interval distinguishable in sequence space. 0031-9007=06=96(3)=034105(4)$23.00 034105-1 © 2006 The American Physical Society PHYSICAL REVIEW LETTERS week ending PRL 96, 034105 (2006) 27 JANUARY 2006 Returning to the CML, denote by F the product function of fi onto each site, and by A an N N coupling matrix. Then (1) can be generalized as the composition H A F, where A is chosen consistent with H: IN ! IN. Assuming A is nonsingular, the elements of Hÿ1 are X ÿ1 ÿ1 ÿ1 j H x0i fi Aij x0 ; (4) j ÿ1 ÿ1 keeping in mind that fi is multivalued. Because fi acts alone on the ith element the associated generating partition i P of the solitary map fi suffices to distinguish the ÿ1 branches of Hi . Accordingly, we propose a partition for the CML that is the product of the partitions of the local maps. More precisely, _N i 1 2 N P CML P P _ P _ ..._ P ; (5) FIG. 1. Refinements of the square under a two element qua- i1 dratic map lattice, Eq. (6), with coupling strength 0:1. 0 0 (a) The primary partitioning of the square into four symbols, where P _ P fPk \ Pl: 0 k jP j1; 0 l (b) the second refinement into 2-block sequences, (c) 3-block 0 0 jP j1g is the mathematical join of P and P . The sequences (unlabeled) with region 313 darkened, and (d) region form of (4) implies that the preimages of H x0 are 313 subdivided into its 4-block words. The equivalent sequences uniquely labeled under this choice of partition. We con- under the inverse Gray transformation are shown parenthetically. jecture, then, that P CML is generating for chaotic behavior in the CML. Our reasoning is that if the ergodicity is the dynamics are considerably more complicated. Empiri- preserved by the coupling then the set of preimages cally, a positive Lyapunov exponent in this regime indi- fHÿn x : n 2 Ng, each labeled differently under P , 0 CML cates that the map is asymptotically expanding along typi- covers the chaotic attractor and thus no two points on the cal orbits and thus the inverse mapping (3) converges to a attractor can be represented by the same semi-infinite 2 symbol sequence. set of zero measure. Figure 1 illustrates the refining of I N into increasingly smaller regions for 0:1. When this In the case where all fi are unimodal, the I state space can be coarsely discretized into 2N regions without incur- process is extended indefinitely, every point on the attractor ring a loss of fine detail on the attractor. As an example, is assigned a different symbol sequence. consider the 2-element lattice H: I2 ! I2 written as The most powerful feature of the symbolic picture is that time evolution is reduced to a simple shift in sequence 1 1 2 xn1 1 ÿ f xnf xn; space. We denote the shift operator as and define its (6) action on a symbol sequence as s s s ...s s s ..., x2 f x1 1 ÿ f x2; 0 1 2 1 2 3 n1 n n so that the effect of is to discard the leading symbol. If n where f x1 ÿ 2x2 is the quadratic map on the interval we set s x0, then it follows from (2) that s I ÿ1; 1. The quadratic map has a generating partition xn. Consequently, the entire evolution of x0 is con- consisting of the regions ÿ1; 0 and 0; 1 which we shall tained in its symbolic representation. A point on a 1 1 1 period-m orbit, for example, is conjugate to a sequence denote as fP0;P1g, respectively, for coordinate x , and as 2 2 2 formed by infinitely repeating m symbols, or m blocks. fP0;P1g for x . Applying (5) the partition for the coupled system is This property has application in describing the spatiotem- poral patterns that are observed in large CMLs [9]. A static 2 1 P CML P _ P or repeating global pattern would be represented by an fP2 \ P1;P2 \ P1;P2 \ P1;P2 \ P1g: (7) eventually stationary or eventually periodic symbolic se- 0 0 0 1 1 0 1 1 quence. Spatially localized structures, such as traveling Reading the subscripts of each term as a binary number, we waves, appear in the bitwise decomposition of the symbols. relabel the regions as fP0;P1;P2;P3g and assign to them In all cases, spatiotemporal patterns are more efficiently the symbols 0, 1, 2, and 3.
Load more

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]