Coupled Arnol'd cat maps on circulant graphs
Abstract
This paper investigates the chaotic properties of Arnol'd cat maps (ACMs) coupled on the nodes of a circulant graph. By demanding that the system's evolution matrix be symplectic, we determine the coupling matrix, which is naturally interpreted as the adjacency matrix of a circulant graph. Specifically, the study analyses the system's Lyapunov spectra and Kolmogorov-Sinai (K-S) entropy. Numerical simulations yield the counterintuitive result that the entropy production does not increase as the connectivity of the graph increases, due to the translational symmetry of the circulant graph. Moreover, we analyse the spectra of the periods of the evolution matrix on a finite toroidal phase space of the dynamical system.
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.