Related papers: Critical parameters of the synchronisation's stabi…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
Synchronization of two replicas of coupled map lattices for continuous maps is known to be in the multiplicative noise universality class. We study this transition in the presence of quenched disorder in coupling. The disorder is identical…
Symmetries are an essential feature of complex networks as they regulate how the graph collective dynamics organizes into clustered states. We here show how to control network symmetries, and how to enforce patterned states of…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
We show that for large coupling delays the synchronizability of delay-coupled networks of identical units relates in a simple way to the spectral properties of the network topology. The master stability function used to determine stability…
We study symmetric motifs in random geometric graphs. Symmetric motifs are subsets of nodes which have the same adjacencies. These subgraphs are particularly prevalent in random geometric graphs and appear in the Laplacian and adjacency…
In a paper by Nishikawa and Motter, a quantity called the normalized spread of the Laplacian eigenvalues is used to measure the synchronizability of certain network dynamics. Through simulations, and without theoretical validation, it is…
We prove strong statistical stability of a large class of one-dimensional maps which may have an arbitrary finite number of discontinuities and of non-degenerate critical points and/or singular points with infinite derivative, and satisfy…
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…
In this paper, we study the controllability and stabilizability properties of the Kolmogorov forward equation of a continuous time Markov chain (CTMC) evolving on a finite state space, using the transition rates as the control parameters.…
We study the discrete-to-continuum consistency of the training of shallow graph convolutional neural networks (GCNNs) on proximity graphs of sampled point clouds under a manifold assumption. Graph convolution is defined spectrally via the…
Recurrent neural networks (RNNs) with random, but sufficiently strong and balanced coupling display a well known high-dimensional chaotic dynamics. Here, we investigate if externally applied inputs to these RNNs can stabilize globally…
Group synchronization arises when two or more synchronization patterns coexist in a network formed of oscillators of different types, with the systems in each group synchronizing on the same time-evolution, but systems in different groups…
We present an improved coupling technique for analyzing the mixing time of Markov chains. Using our technique, we simplify and extend previous results for sampling colorings and independent sets. Our approach uses properties of the…
The Globally Coupled Map Lattice (GCML) is one of the basic model of the intelligence activity. We report that, in its so-called turbulent regime, periodic windows of the element maps foliate and systematically control the dynamics of the…
We introduce a new method for determining the global stability of synchronization in systems of coupled identical maps. The method is based on the study of invariant measures. Besides the simplest non-trivial example, namely two…
We report in details the observations of structures in coupled map lattice during its chaotic evolution, both in one and two dimension, driven by identical noise on each site (by a structure we mean a group of neighboring lattice-sites for…
We study general random dynamical systems of continuous maps on some compact metric space. Assuming a local contraction condition and uniqueness of the stationary measure, we establish probabilistic limit laws such as the central limit…
We show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, there exists a connected graph…
We investigate the spatiotemporal dynamics of a network of coupled chaotic maps, with varying degrees of randomness in coupling connections. While strictly nearest neighbour coupling never allows spatiotemporal synchronization in our…