Synchrony patterns in Laplacian networks

TL;DR

This paper introduces a generalized class of Laplacian networks modeled by symmetric Jacobian matrices, providing eigenvalue estimates from graph topology and analyzing stability of synchronized states in ring networks.

Contribution

It defines Laplacian networks via mappings with symmetric Jacobians, derives eigenvalue bounds from graph structure, and characterizes the mappings, advancing understanding of synchronization stability.

Findings

Eigenvalue estimates derived from graph topology.

Characterization of mappings defining Laplacian networks.

Stability analysis of equilibria in ring networks with extra couplings.

Abstract

A network of coupled dynamical systems is represented by a graph whose vertices represent individual cells and whose edges represent couplings between cells. Motivated by the impact of synchronization results of the Kuramoto networks, we introduce the generalized class of Laplacian networks, governed by mappings whose Jacobian at any point is a symmetric matrix with row entries summing to zero. By recognizing this matrix with a weighted Laplacian of the associated graph, we derive the optimal estimates of its positive, null and negative eigenvalues directly from the graph topology. Furthermore, we provide a characterization of the mappings that define Laplacian networks. Lastly, we discuss stability of equilibria inside synchrony subspaces for two types of Laplacian network on a ring with some extra couplings.