IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v63y2008i3p399-406.html
   My bibliography  Save this article

Chaos synchronization in networks of coupled maps with time-varying topologies

Author

Listed:
  • W. L. Lu
  • F. M. Atay
  • J. Jost

Abstract

Complexity of dynamical networks can arise not only from the complexity of the topological structure but also from the time evolution of the topology. In this paper, we study the synchronous motion of coupled maps in time-varying complex networks both analytically and numerically. The temporal variation is rather general and formalized as being driven by a metric dynamical system. Four network models are discussed in detail in which the interconnections between vertices vary through time randomly. These models are: 1) i.i.d. sequences of random graphs with fixed wiring probability, 2) groups of graphs with random switches between the individual graphs, 3) graphs with temporary random failures of nodes, and 4) the meet-for-dinner model where the vertices are randomly grouped. We show that the temporal variation and randomness of the connection topology can enhance synchronizability in many cases; however, there are also instances where they reduce synchronizability. In analytical terms, the Hajnal diameter of the coupling matrix sequence is presented as a measure for the synchronizability of the graph topology. In topological terms, the decisive criterion for synchronization of coupled chaotic maps is that the union of the time-varying graphs contains a spanning tree. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2008

Suggested Citation

  • W. L. Lu & F. M. Atay & J. Jost, 2008. "Chaos synchronization in networks of coupled maps with time-varying topologies," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 63(3), pages 399-406, June.
    • Handle: RePEc:spr:eurphb:v:63:y:2008:i:3:p:399-406
    DOI: 10.1140/epjb/e2008-00023-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2008-00023-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2008-00023-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:63:y:2008:i:3:p:399-406. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.