Search arXivSearch

arXiv · 2106.06611

One-way dependent clusters and stability of cluster synchronization in directed networks

Abstract

Cluster synchronization in networks of coupled oscillators is the subject of broad interest from the scientific community, with applications ranging from neural to social and animal networks and technological systems. Most of these networks are directed, with flows of information or energy that propagate unidirectionally from given nodes to other nodes. Nevertheless, most of the work on cluster synchronization has focused on undirected networks. Here we characterize cluster synchronization in general directed networks. Our first observation is that, in directed networks, a cluster A of nodes might be one-way dependent on another cluster B: in this case, A may remain synchronized provided that B is stable, but the opposite does not hold. The main contribution of this paper is a method to transform the cluster stability problem in an irreducible form. In this way, we decompose the original problem into subproblems of the lowest dimension, which allows us to immediately detect inter-dependencies among clusters. We apply our analysis to two examples of interest, a human network of violin players executing a musical piece for which directed interactions may be either activated or deactivated by the musicians, and a multilayer neural network with directed layer-to-layer connections.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matteo Lodi, Francesco Sorrentino, Marco Storace. 2021-07-01. One-way dependent clusters and stability of cluster synchronization in directed networks. https://doi.org/10.1038/s41467-021-24363-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS