Random Delays and the Synchronization of Chaotic Maps

Abstract

We investigate the dynamics of an array of logistic maps coupled with random delay times. We report that for adequate coupling strength the array is able to synchronize, in spite of the random delays. Specifically, we find that the synchronized state is a homogeneous steady-state, where the chaotic dynamics of the individual maps is suppressed. This differs drastically from the synchronization with instantaneous and fixed-delay coupling, as in those cases the dynamics is chaotic. Also in contrast with the instantaneous and fixed-delay cases, the synchronization does not dependent on the connection topology, depends only on the average number of links per node. We find a scaling law that relates the distance to synchronization with the randomness of the delays. We also carry out a statistical linear stability analysis that confirms the numerical results and provides a better understanding of the nontrivial roles of random delayed interactions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…