Lably
Skip to content

Coupled map lattice

Dynamical system

  • 5 min read
  • 6 chapters

Related on Lably

Through Dynamical system, State variable and Population dynamics

Features of the CML are discrete time dynamics, discrete underlying spaces (lattices or networks), and real (number or vector), local, continuous state variables. Studied systems include populations, chemical reactions, convection, fluid flow and biological networks. More recently, CMLs have been applied to computational networks identifying detrimental attack methods and cascading failures.

CMLs are comparable to cellular automata models in terms of their discrete features. However, the value of each site in a cellular automata network is strictly dependent on its neighbor(s) from the previous time step. Each site of the CML is only dependent upon its neighbors relative to the coupling term in the recurrence equation. However, the similarities can be compounded when considering multi-component dynamical systems.

Introduction

A CML generally incorporates a system of equations (coupled or uncoupled), a finite number of variables, a global or local coupling scheme and the corresponding coupling terms. The underlying lattice can exist in infinite dimensions. Mappings of interest in CMLs generally demonstrate chaotic behavior. Such maps can be found here: List of chaotic maps.

A logistic mapping demonstrates chaotic behavior, easily identifiable in one dimension for parameter r > 3.57:

xn+1=rxn(1−xn)

In Figure 1, x0 is initialized to random values across a small lattice; the values are decoupled with respect to neighboring sites. The same recurrence relation is applied at each lattice point, although the parameter r is slightly increased with each time step. The result is a raw form of chaotic behavior in a map lattice. However, there are no significant spatial correlations or pertinent fronts to the chaotic behavior. No obvious order is apparent.

For a basic coupling, we consider a 'single neighbor' coupling where the value at any given site s is computed from the recursive maps both on s itself and on the neighboring site s−1. The coupling parameter ϵ=0.5 is equally weighted. Again, the value of r is constant across the lattice, but slightly increased with each time step.

xn+1=(ϵ)[rxn(1−xn)]s+(1−ϵ)[rxn(1−xn)]s−1

Even though the recursion is chaotic, a more solid form develops in the evolution. Elongated convective spaces persist throughout the lattice (see Figure 2).

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Physics