Refrence 3
Refrence 3
com
PR China
Abstract
We study the synchronization of coupled map lattices with small-world interactions and cou-
pling delays in this paper. A stability criterion for the synchronized state is derived. Numerical
examples are presented to demonstrate the correctness of our theoretical result.
c 2003 Elsevier B.V. All rights reserved.
PACS: 05.45.−a
1. Introduction
Coupled map lattices (CML) were introduced by Kaneko (for a list of references see
Ref. [1]) as models to understand spatially extended nonlinear systems using building
blocks that are well understood. Over the last two decades CML have attracted much
attention [1,2]. Up to date, most of the existing work on CML assumes that the coupling
con?guration is completely regular, while a few studies address the randomly coupled
CML. However, interactions in many biological, technological and social systems are
neither completely regular nor completely random. To interpolate between these two
extremes, Watts and Strogatz [3] introduced the interesting concept of small-world
(SW) networks. The so-called SW networks have intermediate connectivity properties
but exhibit a high degree of clustering as in the regular networks and a small average
∗ Corresponding author.
E-mail address: [email protected] (C. Li).
distance between vertices as in the random networks. In Ref. [4], the authors investigate
the synchronization of CML with SW interactions.
On the other hand, the inclusion of time delays into lattices is natural in the realistic
consideration of ?nite transmission of interactions. The synchronization of globally
coupled map with delayed interactions has recently been studied in Ref. [5].
In this paper, we investigate the synchronization in CML with SW interactions and
delayed coupling. We consider the following one-dimensional array of N maps, coupled
as
N
xi (t + 1) = (1 − )f(xi (t)) + aij f(xj (t − )) ; (1)
Ni
j=1
where f(x) is 1-D map, ¿ 0 is the coupling strength, Ni is the number of signals
the ith map receives. is the time delay constant, which is a nonnegative integer (for
simplicity, we assume that all delays are the same in the lattice). The matrix A = {aij }
encodes the connection topology: if map j sends a signal to i, aij =1; otherwise, aij =0.
N
aii = 0 for all i, and Ni = j=1 aij . If aij = aji , the matrix de?nes an undirected lattice,
otherwise it describes a directed lattice, in which the vertices are the maps. The delays
can be viewed as arising from the ?nite speeds of transmission and spreading as well
as congestions. The normalized prefactor 1=Ni in the coupling means that each vertex
is inJuenced equally by all of the others that send signals to it.
The original SW model introduced in Ref. [3] can be described as follows. Take a
one-dimensional lattice of N vertices arranged in a ring with connections only between
nearest neighbors. We “rewire” each connection with probability p. Rewiring in this
context means reconnecting randomly the whole lattice, with the constraint that no two
diNerent vertices can have more than one connection in between, and no vertex can
have a connection with itself.
Note, however, that there is a possibility for the SW model to be broken into un-
connected clusters. This problem can be resolved by a slight modi?cation of the SW
model, suggested by Newman and Watts (NW) [6]. In the NW model, we do not break
any connection between any two nearest neighbors. Instead, we add with probability
p a connection between each unconnected pair of vertices. Likewise, we do not allow
a vertex to be coupled to another vertex more than once, or coupling of a vertex with
itself. For p = 0, it reduces to the originally nearest-neighbor coupled lattice; for p = 1,
it becomes a globally coupled lattice. From a coupling-matrix point of view, CML (1)
with small-world connections evolves according to the rule that, in the nearest-neighbor
coupling matrix A, if Aij = 0, we set Aij = 1 with probability p.
In this section, we analyze the stability of the synchronized state. For simplicity, we
let = 1 in this section. The cases with other values of can be analyzed similarly.
Clearly, the synchronized state s(t) is governed by
s(t + 1) = (1 − )f(s(t)) + f(s(t − 1)) : (2)
C. Li et al. / Physica A 335 (2004) 365 – 370 367
where ei (t) denotes the ith map’s deviations from s(t). By letting e(t)=[e1 (t), e2 (t); : : : ;
eN (t)], Eq. (3) can be recast as
where G = {Gij }N ×N , with Gij = aij =Ni . Clearly, Gii = 0 for all i, and the sum of the
entries in each row of G is equal to 1. Let be the eigenvalue of G. Denote the
corresponding eigenvector by d and let u(t) = e(t)d. Then
It is obvious that the synchronized state (2) is (locally) stable if and only if all eigen-
values of the matrix of the error dynamics (6) are within the unit circle on the complex
plane (including t → ∞). The characteristic equation of the error dynamics (6) is
Instead of calculating the solution, we use the Schur Stability Test (see Appendix A
in Ref. [7] or [8]) to determine the stability conditions. From the Schur Stability Test,
the stability conditions of the synchronized state are
|f (s(t − 1))| ¡ 1 ;
(8)
|(1 − )f (s(t))(1 + f (s(t − 1)))| ¡ |1 − 2 ||2 f (s(t − 1))2 | :
Although we can only calculate the eigenvalues of the connection matrix numerically
in SW networks, we can bound their location by using the Gerschgorin’s circle theorem
[9]. Applying Gerschgorin’s circle theorem to matrix G, we ?nd that all the eigenvalues
lie in, or on the unit circle, since Gii = 0 for all i and the sum of the entries in each
row of G is equal to 1. That is, || 6 1.
If the lattice is undirected, that is A is symmetric, then is real valued. From
(8) and || 6 1, we know that the following condition guarantees the stability of the
synchronized state:
We also analyze the stability conditions of the synchronized states of networks with-
out and with longer interaction delays using similar methods. All the stability conditions
depend on the form of the function f. When considering general function f, no explicit
relationship among these stability conditions is found.
3. Numerical simulations
Fig. 1. The curve of xk (t) − x1 (t): (a) p = 0:1, N = 100; (b) p = 0:5, N = 200.
C. Li et al. / Physica A 335 (2004) 365 – 370 369
Fig. 2. The “bifurcation diagram” of the mean ?eld h(t) as a function of p: (a) pN = 1; (b) pN = 2.
4. Conclusions
Acknowledgements
This work was supported by the National Natural Science Foundation of China under
Grant 60271019, and the Youth Science and Technology Foundation of UESTC under
Grant YF020207.
References
[1] K. Kaneko (Ed.), Theory and Applications of Coupled Map Lattices, Wiley, New York, 1993.
[2] K. Kaneko, Phys. Rev. Lett. 65 (1990) 1391;
P.M. Gade, H. Cerdeira, R. Ramaswamy, Phys. Rev. E 52 (1995) 2478;
D.H. Zanette, Europhys. Lett. 45 (2000) 424;
A.L. Gelover-Santiago, R. Lima, G. Matinez-Mekler, Physica A 283 (2000) 131.
[3] D.J. Watts, S.H. Strogatz, Nature 393 (1998) 440.
[4] P.M. Gade, C.K. Hu, Phys. Rev. E 62 (2000) 6409;
C. Li, X. Liao, J. Yu, Physica A, in press.
[5] C. Masoller, A.C. Marti, D.H. Zanette, Physica A 325 (2003) 186.
[6] M.E.J. Newman, D.J. Watts, Phys. Rev. E 60 (1999) 7332.
[7] K. Konishi, H. Kokame, Physica D 127 (1999) 1.
[8] S.P. Bhattacharyya, H. Chapellat, L.H. Keel, Robust Control: The Parametric Approach, Prentice-Hall,
Englewood CliNs, NJ, 1995.
[9] H. Minc, Nonnegative Matrices, Wiley, New York, 1988.