中国物理B ›› 2008, Vol. 17 ›› Issue (6): 1951-1956.doi: 10.1088/1674-1056/17/6/003

• • 上一篇    下一篇

Synchronization of coupled logistic maps on random community networks

许新建1, 冯存芳2, 吴枝喜2, 汪映海2   

  1. (1)Departamento de F'isica da Universidade de Aveiro, 3810-193 Aveiro, Portugal; (2)Institute of Theoretical Physics, Lanzhou University, Lanzhou 730000, China
  • 收稿日期:2007-08-30 修回日期:2007-10-30 出版日期:2008-06-20 发布日期:2008-06-20
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No 10775060).

Synchronization of coupled logistic maps on random community networks

Feng Cun-Fang(冯存芳)a), Xu Xin-Jian(许新建)b), Wu Zhi-Xi(吴枝喜)a), and Wang Ying-Hai(汪映海)a)†   

  1. a Institute of Theoretical Physics, Lanzhou University, Lanzhou 730000, China; b Departamento de F'isica da Universidade de Aveiro, 3810-193 Aveiro, Portugal
  • Received:2007-08-30 Revised:2007-10-30 Online:2008-06-20 Published:2008-06-20
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No 10775060).

摘要: The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter $m$, and the other is the ratio $\sigma$ of the connection probability $p$ of each pair of nodes within each community to the connection probability $q$ of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger $m$ and smaller $\sigma$ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.

关键词: complex networks, synchronization, random community networks

Abstract: The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter $m$, and the other is the ratio $\sigma$ of the connection probability $p$ of each pair of nodes within each community to the connection probability $q$ of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger $m$ and smaller $\sigma$ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.

Key words: complex networks, synchronization, random community networks

中图分类号:  (Coupled map lattices)

  • 05.45.Ra
05.45.Xt (Synchronization; coupled oscillators) 89.75.Hc (Networks and genealogical trees)