This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Symmetries and Cluster Synchronization in Multilayer Networks

Fabio Della Rossa University of New Mexico, Albuquerque, NM, 87131, USA Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy Louis Pecora U.S. Naval Research Laboratory, Washington, DC 20375, USA Karen Blaha University of New Mexico, Albuquerque, NM, 87131, USA Afroza Shirin University of New Mexico, Albuquerque, NM, 87131, USA Isaac Klickstein University of New Mexico, Albuquerque, NM, 87131, USA Francesco Sorrentino University of New Mexico, Albuquerque, NM, 87131, USA Corresponding author [email protected]
Abstract

Real-world systems in epidemiology, social sciences, power transportation, economics and engineering are often described as multilayer networks. Here we first define and compute the symmetries of multilayer networks, and then study the emergence of cluster synchronization in these networks. We distinguish between independent layer symmetries which occur in one layer and are independent of the other layers and dependent layer symmetries which involve nodes in different layers. We study stability of the cluster synchronous solution by decoupling the problem into a number of independent blocks and assessing stability of each block through a Master Stability Function. We see that blocks associated with dependent layer symmetries have a different structure than the other blocks, which affects the stability of clusters associated with these symmetries. Finally, we validate the theory in a fully analog experiment in which seven electronic oscillators of three kinds are connected with two kinds of coupling.

Introduction

Real-world complex systems often contain heterogeneous components; these components may interact in multiple ways via complex connectivity patterns, leading to complex dynamics. For example, the power grid contains both a transmission and a communication network, and we must model both to understand phenomena such as cascade failures [1, 2] and blackouts duration [3, 4]. In this context, a recent paper [3] has shown that increased coupling between the power and the communication layers can be beneficial in reducing vulnerability of the system as a whole. Neurological systems can be modeled with varying levels of complexity depending on the particular behavior of interest. Some approaches have a single kind of neurons which interact via multiple interaction layers [5, 6, 7, 8]; central pattern generator approaches [9, 10, 11] have multiple kinds of neurons (identified by kind, such as extensor, flexor, synapses generator, etc.) which interact via multiple interaction layers. The mathematical formalism introduced for these types of problems is the multilayer network [12, 13, 14].

We are interested in symmetries and synchronization of multilayer networks of coupled oscillators; synchronization is a collective behavior in which the dynamics of the network nodes converge on the same time-evolution. The first study of synchronization in multilayer networks was presented in [8, 15] and more recently in [16]. These papers studied complete synchronization (all nodes synchronize on the same time-evolution) and consider diffusive coupling (the coupling matrices are Laplacian). Populations may exhibit more complex forms of synchronization, such as clustered synchronization (CS), where clusters of nodes exhibit synchronized dynamics but different clusters evolve on distinct time evolutions; many papers consider CS in networks formed of nodes all of the same type and connections all of the same type [17, 18, 19, 20, 21, 22, 23, 24].

The emergence of synchronized clusters in a network requires that the set of the network nodes is partitioned into subsets of nodes, called equitable clusters, such that all the nodes in the same cluster receive the same total input from each one of the clusters, leading to the same temporal evolution [25, 26, 27]. These partitions often arise from the network symmetries [28, 29]. A recent paper studied the effects of symmetry on collective dynamics in communities of coupled oscillators [30]. When equitable partitions arise from symmetry, a rigorous, group theory-based framework exists to analyze the stability of cluster synchronization in simple networks [20, 21, 24]. However, cluster synchronization in multilayer networks has not been studied other than in a recent paper which focused on experimental observations on a special multilayer network composed of nodes all of the same type [31].

This paper significantly advances the field of network dynamics by presenting one unified theory that addresses the problem of cluster synchronization in arbitrary multilayer networks, where each layer is formed of homogeneous units, but different layers have different units. Our main contributions are twofold: we define and compute the symmetries of multilayer networks and we study the emergence of cluster synchronization in these networks analytically and experimentally. This involves analyzing stability of the cluster synchronous solution, where the stability problem is decoupled into a number of lower dimensional blocks of equations and a validation of the theory in a fully analog experiment with three layers, each one formed of different types of oscillators. We analyze CS in arbitrary multilayer networks, for which nodes are coupled through both intra-layer connections (inside each layer) and inter-layer connections (between different layers.) We see that CS patterns of synchronization in multilayer networks are determined by the symmetries of each individual layer but also the particular pattern of interconnectivity between layers. We see that only nodes from the same layer may be permuted among each other. However, other symmetries may involve simultaneous swaps of nodes in different layers. This leads to a classification of symmetries into Independent Layer Symmetries (ILS) which occur in one layer and are independent of swaps in other layers and Dependent Layer Symmetries (DLS) which require moving nodes in different layers. In what follows, we first present a general set of dynamical equations for the time evolution of multilayer networks, we then define and compute the group of symmetries of multilayer networks with different kinds of nodes (each corresponding to a different layer) and different kinds of connections, for which stability of the CS solution is analyzed, and finally we apply the theoretical framework to predict the emergence of CS in an experimental system.

Results

Formulation and Dynamical Equations

Multilayer networks have different types of nodes interacting through different types of connections [12, 13]. Previously defined subclasses of multilayer networks include multiplex [32, 33, 34] and multidimensional [35, 36] networks. In a multiplex network, the same set of agents exists in all layers; for example, in a social system, each node is a person, each layer represents opinion on a topic, and links capture how social interactions influence a person’s opinion on each topic. In a multidimensional network, different kinds of links connect the same set of nodes, all of the same type. For a deeper discussion of particular multilayer networks and how to reconcile each case with the general definition of a multilayer network, see [12, 13]. Sometimes the term ‘multilayer network’ has been used in the literature to indicate generic networks formed of different types of nodes and/or connections. For example, in [31] a ‘multilayer network’ has connections of different types but nodes all of the same type. Here we consider the most general situation for which both nodes and connections can be of different types, with the case of Ref. [31] remaining a special case of multilayer network.

Reference [37] introduced a mathematical model for the time evolution of a multiplex network. Following previous studies of synchronization in different instances of multilayer networks [8, 15, 37, 16, 31], next we provide a general set of equations that describe the dynamics of a multilayer network. First we define the sets of nodes and of connections (or interactions) of a multilayer network. The nodes are arranged in sets {Xα,α=1,,M}\{X^{\alpha},\alpha=1,\ldots,M\}, where each individual set corresponds to a given layer of the multilayer network. The uncoupled dynamics of all the NαN^{\alpha} nodes in layer XαX^{\alpha} is the same: 𝐱˙iα=𝐅α(𝐱iα)\dot{\bf x}_{i}^{\alpha}={\bf F}^{\alpha}({\bf x}_{i}^{\alpha}), i=1,,Nαi=1,\ldots,N^{\alpha}, 𝐱αnα{\bf x}^{\alpha}\in\mathbb{R}^{n^{\alpha}}. The multilayer network has a total number of nodes equal to N=αNαN=\sum_{\alpha}N^{\alpha}. The set of connections correspond to either intra-layer interactions that connect nodes in the same layer or inter-layer interactions that connect nodes in different layers. The intra-layer interactions inside layer α\alpha are described by an adjacency matrix AααA^{\alpha\alpha}, to which is associated a nonlinear coupling function 𝐇αα:nαnα{\bf H}^{\alpha\alpha}:\mathbb{R}^{n^{\alpha}}\mapsto\mathbb{R}^{n^{\alpha}} and a coupling strength σαα\sigma^{\alpha\alpha}. The inter-layer interactions from layer β\beta to layer α\alpha are described by an Nα×NβN^{\alpha}\times N^{\beta} adjacency matrix AαβA^{\alpha\beta}, to which is associated a nonlinear coupling function 𝐇αβ:nαnβ{\bf H}^{\alpha\beta}:\mathbb{R}^{n^{\alpha}}\mapsto\mathbb{R}^{n^{\beta}} and a coupling strength σαβ\sigma^{\alpha\beta}. We assume throughout that all the couplings are undirected: Aαβ,λ=Aβα,λTA^{\alpha\beta,\lambda}={A^{\beta\alpha,\lambda}}^{T}, α,β=1,,M\alpha,\beta=1,...,M.

We show an example of a multilayer network in Fig. 1a. This network has two layers, labeled α\alpha and β\beta, with intra-connectivity described by the matrices AααA^{\alpha\alpha} and AββA^{\beta\beta} and inter-connectivity described by the matrix Aαβ=(Aβα)TA^{\alpha\beta}=(A^{\beta\alpha})^{T}, all shown in b. Fig. 1c shows an independent layer symmetry. This symmetry involves only nodes in layer α\alpha; we can swap α\alpha nodes 11 with 22 and α\alpha nodes 33 with 44 without affecting layer β\beta. Fig. 1d shows a dependent layer symmetry. This symmetry requires swapping nodes in both layer α\alpha and β\beta; when we swap α\alpha nodes 22 with 33 and α\alpha nodes 11 with 44, we must also swap β\beta nodes 11 and 33. Note that as dependent layer symmetries involve swapping nodes of different types, they are a characteristic feature of multilayer networks with different types of nodes.

Refer to caption
Figure 1: Illustration of Independent Layer Symmetries and Dependent Layer Symmetries. a A simple two layer network with intra-connectivity described by the matrices AααA^{\alpha\alpha} and AββA^{\beta\beta} and inter-connectivity described by the matrix Aαβ=(Aβα)TA^{\alpha\beta}=(A^{\beta\alpha})^{T} (in b). c Example of an Independent Layer Symmetry for the multilayer network in a. d Example of a Dependent Layer Symmetry for the multilayer network in a.

The dynamics of node ii in layer α\alpha of the multilayer network is governed by the following set of differential equations,

𝐱˙iα=𝐅α(𝐱iα)+σααj=1NαAijαα𝐇αα(𝐱jα)intra-layer couplings+βασαβj=1NβAijαβ𝐇αβ(𝐱jβ)inter-layer couplings,\dot{\bf x}_{i}^{\alpha}={\bf F}^{\alpha}({\bf x}_{i}^{\alpha})+\underbrace{\sigma^{\alpha\alpha}\sum_{j=1}^{N^{\alpha}}A^{\alpha\alpha}_{ij}{\bf H}^{\alpha\alpha}({\bf x}_{j}^{\alpha})}_{\text{intra-layer couplings}}+\underbrace{\sum_{\beta\neq\alpha}\sigma^{\alpha\beta}\sum_{j=1}^{N^{\beta}}A^{\alpha\beta}_{ij}{\bf H}^{\alpha\beta}({\bf x}_{j}^{\beta})}_{\text{inter-layer couplings}}, (1)

i=1,,Nαi=1,...,N^{\alpha}, α=1,,M\alpha=1,...,M. The underlying assumption here is that functions that are labeled differently are different functions. By this we mean 𝐅α(x)𝐅β(x){\bf F}^{\alpha}(x)\neq{\bf F}^{\beta}(x), for βα\beta\neq\alpha.

Next we introduce a vectorial notation. We combine the dynamical variables from each layer into a vector of vectors 𝐱α=[𝐱1α,𝐱2α,,𝐱Nαα]{\bf x}^{\alpha}=[{\bf x}^{\alpha}_{1},{\bf x}^{\alpha}_{2},...,{\bf x}^{\alpha}_{N^{\alpha}}] (here and after, the comma stands for vertical stacking of vector and the square brackets stand for vector concatenation). Likewise, we can define,

𝐅α(𝐱α)=[𝐅α(𝐱1α),𝐅α(𝐱2α),,𝐅α(𝐱Nαα)],{\bf F}^{\alpha}({\bf x}^{\alpha})=[{\bf F}^{\alpha}({\bf x}^{\alpha}_{1}),{\bf F}^{\alpha}({\bf x}^{\alpha}_{2}),...,{\bf F}^{\alpha}({\bf x}^{\alpha}_{N^{\alpha}})], (2)
𝐇αα(𝐱α)=[𝐇αα(𝐱1α),𝐇αα(𝐱2α),,𝐇αα(𝐱Nαα)],{\bf H}^{\alpha\alpha}({\bf x}^{\alpha})=[{\bf H}^{\alpha\alpha}({\bf x}^{\alpha}_{1}),{\bf H}^{\alpha\alpha}({\bf x}^{\alpha}_{2}),...,{\bf H}^{\alpha\alpha}({\bf x}^{\alpha}_{N^{\alpha}})], (3)
𝐇αβ(𝐱β)=[𝐇αβ(𝐱1β),𝐇αβ(𝐱2β),,𝐇αβ(𝐱Nββ)].{\bf H}^{\alpha\beta}({\bf x}^{\beta})=[{\bf H}^{\alpha\beta}({\bf x}^{\beta}_{1}),{\bf H}^{\alpha\beta}({\bf x}^{\beta}_{2}),...,{\bf H}^{\alpha\beta}({\bf x}^{\beta}_{N^{\beta}})]. (4)

This notation suppresses the summations over the nodes in each layer. We obtain the set (one for each layer) of vector equations

𝐱˙α=𝐅α(𝐱α)+σααAαα𝐇αα(𝐱α)+βασαβAαβ𝐇αβ(𝐱β),α=1,,M.\dot{\bf x}^{\alpha}={\bf F}^{\alpha}({\bf x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}({\bf x}^{\alpha})+\sum_{\beta\neq\alpha}\sigma^{\alpha\beta}A^{\alpha\beta}{\bf H}^{\alpha\beta}({\bf x}^{\beta}),\quad\alpha=1,...,M. (5)

Two nodes ii and jj are synchronized if 𝐱i(t)=𝐱j(t)t{\bf x}_{i}(t)={\bf x}_{j}(t)\,\forall t. Synchronous motions define invariant manifolds of Eqs. (5), i.e., 𝐱i=𝐱j𝐱˙i=𝐱˙j{\bf x}_{i}={\bf x}_{j}\Rightarrow\dot{\bf x}_{i}=\dot{\bf x}_{j}. In order to study cluster synchronization, we will look for symmetries in the multilayer network; these are the node permutations that leave system (5) unchanged. The group of symmetries of the multilayer network is the set of permutations of the nodes that do not change Eqs. (5) for α=1,,M\alpha=1,...,M. Below we explain how to find this group of symmetries in arbitrary multilayer networks, and we investigate the relations between intralayer and interlayer connections in order to preserve certain symmetries properties.

Symmetries of Multilayer Networks

Symmetries of complex networks have received recent attention from the scientific community. These symmetries influence network structural [28], spectral [38], and dynamical properties [39], including cluster synchronization [20, 21]. However, symmetries of multilayer networks have not been studied.

Here we define the group of symmetries of general multilayer networks with both nodes of different types and connections of different types. Although we will eventually use computational methods to find the symmetry group of a particular network, it is best to understand what types of structures are imposed on the symmetry group of a multilayered network in general. The study of the symmetry group provides insight into the results of the numerical calculations and into whether what we find is general or just a property of the particular network we are analyzing. Next we develop some of the mathematical properties of the final permutation group structure of the multilayer systems. As we will see, the interplay between the symmetries in each layer with the symmetries in other layers is subtle and leads to interesting structures in the final group of the whole network.

We first show that the multilayer structure imposes a block diagonal form on the permutations of the whole group. Since each layer of the network contains a different kind of node, symmetries are not allowed to move nodes from different layers. As a result, the symmetry group 𝒢{\mathcal{G}} of the multilayer network is represented by block diagonal permutation matrices, i. e., each g𝒢g\in{\mathcal{G}} is of the form,

g=(gα000gβ000gγ),g=\begin{pmatrix}g_{\alpha}&0&0&\ldots\\ 0&g_{\beta}&0&\ldots\\ 0&0&g_{\gamma}&\ldots\\ \vdots&\vdots&\vdots&\ddots\end{pmatrix}, (6)

where gαg_{\alpha} is a permutation matrix for layer α\alpha, gβg_{\beta} is a permutation matrix for layer β\beta, and so on. In this section we show that the symmetries of the group 𝒢{\mathcal{G}} of the multilayer network are formed of the symmetries of the single-layers (i.e., gα𝒢αg_{\alpha}\in{\mathcal{G}}^{\alpha}, gβ𝒢βg_{\beta}\in{\mathcal{G}}^{\beta}, …) that are compatible with each other, where compatibility is determined by the inter-layer couplings. This means that if we perform a permutation on layer α\alpha, we must perform a permutation on each other layer (which in some cases may be the identity permutation) by leaving the structure of the overall network unaltered. As a result, compatibility links permutations from the groups of symmetries of each layer, so that we preserve the symmetry of the whole multilayer network. The major question we want to answer here is: how does compatibility relate permutations from different layers?

Let us consider a multilayer system with two layers α\alpha and β\beta. Eq. (5) becomes,

𝐱˙α=𝐅α(𝐱α)+σααAαα𝐇αα(𝐱α)+σαβAαβ𝐇αβ(𝐱β)𝐱˙β=𝐅β(𝐱β)+σββAββ𝐇ββ(𝐱β)+σβαAβα𝐇βα(𝐱α).\begin{array}[]{rcl}\dot{\bf x}^{\alpha}&=&{\bf F}^{\alpha}({\bf x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}({\bf x}^{\alpha})+\sigma^{\alpha\beta}A^{\alpha\beta}{\bf H}^{\alpha\beta}({\bf x}^{\beta})\\ \dot{\bf x}^{\beta}&=&{\bf F}^{\beta}({\bf x}^{\beta})+\sigma^{\beta\beta}A^{\beta\beta}{\bf H}^{\beta\beta}({\bf x}^{\beta})+\sigma^{\beta\alpha}A^{\beta\alpha}{\bf H}^{\beta\alpha}({\bf x}^{\alpha}).\end{array} (7)

In Methods, we show that we can determine the symmetry group of a multilayer network with M>2M>2 layers, multiple edge types inside each layer and in between layers. Consider two permutations g𝒢αg\in{\mathcal{G}}^{\alpha} and h𝒢βh\in{\mathcal{G}}^{\beta}. We know from Eq. (6) that a symmetry of this multilayer network is in the form

(g00h),\begin{pmatrix}g&0\\ 0&h\end{pmatrix}, (8)

so, which gg’s and hh’s are compatible? For the answer, we consider the inter-layer couplings terms,

σαβAαβ𝐇αβ(𝒙β)andσβαAβα𝐇βα(𝒙α).\sigma^{\alpha\beta}A^{\alpha\beta}{\bf H}^{\alpha\beta}({\boldsymbol{x}}^{\beta})\qquad\mbox{and}\qquad\sigma^{\beta\alpha}A^{\beta\alpha}{\bf H}^{\beta\alpha}({\boldsymbol{x}}^{\alpha}). (9)

We say that symmetry-related nodes must be flow invariant. That is, the symmetries must guarantee that synchronized nodes have equal dynamical variables when we include inter-layer coupling.

Application of the two permutations to the equations of the multilayer network results in

g(𝐱˙α)=𝐅α(g𝐱α)+σααAαα𝐇αα(g𝐱α)+σαβgAαβ𝐇αβ(𝐱β)h(𝐱˙β)=𝐅β(h𝐱β)+σββAββ𝐇ββ(h𝐱β)+σβαhAβα𝐇βα(𝐱α),\begin{array}[]{rcl}g{(\dot{\bf x}^{\alpha})}&=&{\bf F}^{\alpha}(g{\bf x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}(g{\bf x}^{\alpha})+\sigma^{\alpha\beta}gA^{\alpha\beta}{\bf H}^{\alpha\beta}({\bf x}^{\beta})\\ h(\dot{{\bf x}}^{\beta})&=&{\bf F}^{\beta}(h{\bf x}^{\beta})+\sigma^{\beta\beta}A^{\beta\beta}{\bf H}^{\beta\beta}(h{\bf x}^{\beta})+\sigma^{\beta\alpha}hA^{\beta\alpha}{\bf H}^{\beta\alpha}({\bf x}^{\alpha}),\end{array} (10)

where the gg and hh permutations can be taken into the arguments of 𝐅α,𝐇αα{\bf F}^{\alpha},{\bf H}^{\alpha\alpha} and 𝐅β,𝐇ββ{\bf F}^{\beta},{\bf H}^{\beta\beta}, respectively since the functions operate sequentially on their vector arguments and we have used the properties that gg commutes with AααA^{\alpha\alpha} and hh commutes with AββA^{\beta\beta}.

To achieve flow invariance, we need gg and hh to act on 𝐱α{\mathbf{x}}^{\alpha} and 𝐱β{\mathbf{x}}^{\beta}, respectively, in the arguments of the interlayer coupling terms 𝐇αβ{\bf H}^{\alpha\beta} and 𝐇βα{\bf H}^{\beta\alpha}. Note that this does not require commutability (gAαβ=AαβggA^{\alpha\beta}=A^{\alpha\beta}g) since we want to ‘exchange’ gg for hh and vice-versa (as the interlayer coupling matrices are generally not square, we do not expect commmutability). More generally, conjugacy relations are the requirements for symmetry compatibility, i.e.,

gAαβ=AαβhandhAβα=Aβαg;gA^{\alpha\beta}=A^{\alpha\beta}h\qquad\mbox{and}\qquad hA^{\beta\alpha}=A^{\beta\alpha}g; (11)

which can be thought of as compatibility relations between permutations of the α\alpha and β\beta layers. This means that the gg’s and the hh’s must be paired properly to satisfy Eq. (11). In general, not all the hh’s are compatible with all the gg’s, as the conjugacy relations restrict compatible permutations to subgroups of 𝒢α{\mathcal{G}}^{\alpha} and 𝒢β{\mathcal{G}}^{\beta}. The final group 𝒢{\mathcal{G}} of the multilayer network is determined by the structure of these particular subgroups.

The permutations that fulfill the conjugacy relations (11) are defined by the following sets,

α={g𝒢α|gAαβ=Aαβh and hAβα=Aβαg for some h𝒢β}\mathcal{H}^{\alpha}=\{g\in\mathcal{G}^{\alpha}|gA^{\alpha\beta}=A^{\alpha\beta}h\ \mbox{ and }hA^{\beta\alpha}=A^{\beta\alpha}g\mbox{ for some }\ h\in\mathcal{G}^{\beta}\} (12)

and

β={h𝒢β|hAβα=Aβαg and gAαβ=Aαβh for some g𝒢α}.\mathcal{H}^{\beta}=\{h\in\mathcal{G}^{\beta}|hA^{\beta\alpha}=A^{\beta\alpha}g\ \mbox{ and }gA^{\alpha\beta}=A^{\alpha\beta}h\mbox{ for some }\ g\in\mathcal{G}^{\alpha}\}. (13)

An element gαg\in\mathcal{H}^{\alpha} is represented by an Nα×NαN^{\alpha}\times N^{\alpha} matrix and an element hβh\in\mathcal{H}^{\beta} is represented by an Nβ×NβN^{\beta}\times N^{\beta} matrix. It is important to note that in general the matrix AαβNα×NβA^{\alpha\beta}\in\mathbb{R}^{N^{\alpha}\times N^{\beta}} will have nontrivial left and right null spaces. As a result, we may find more than one gg that satisfies gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h for a given hh and vice versa.

In the Methods (Formal Proofs) we first prove that α\mathcal{H}^{\alpha} is a subgroup of 𝒢α\mathcal{G}^{\alpha} and β\mathcal{H}^{\beta} is a subgroup of 𝒢β\mathcal{G}^{\beta}. Then we show that for the case of undirected networks we only need either one of the following relationships to prove that α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} are subgroups,

gAαβ=AαβhorhAβα=Aβαg.gA^{\alpha\beta}=A^{\alpha\beta}h\qquad\mbox{or}\qquad hA^{\beta\alpha}=A^{\beta\alpha}g. (14)

We can now find the group of symmetries of the multilayer network 𝒢\mathcal{G} from the subgroups α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta}. First, recall that the permutations of 𝒢\mathcal{G} have block structure of Eq. (8). While we use all permutations gαg\in\mathcal{H}^{\alpha} and hβh\in\mathcal{H}^{\beta} to construct 𝒢\mathcal{G}, we can only pair the permutations that satisfy the conjugacy relation in Eq. (11) (or the simpler version in Eq. (14)).

We define an equivalence relation \sim between the elements of α\mathcal{H}^{\alpha}: ggg\sim g^{\prime} if gAαβ=gAαβgA^{\alpha\beta}=g^{\prime}A^{\alpha\beta}. Analogously, hhh\sim h^{\prime} if hAβα=hAβαhA^{\beta\alpha}=h^{\prime}A^{\beta\alpha}. One can verify that \sim is an equivalence relation as it is reflexive, symmetric, and transitive. We also see that if ggg\sim g^{\prime} and gg and hh are conjugate, then so are gg^{\prime} and hh, indicating that \sim defines a partition of each subgroup α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} into disjoint subsets (called equivalence classes) 𝒦iα\mathcal{K}^{\alpha}_{i} and 𝒦iβ\mathcal{K}^{\beta}_{i}, i=1,,Ki=1,...,K, respectively. Each subset 𝒦iα\mathcal{K}^{\alpha}_{i} contains all the permutations gg such that gAαβgA^{\alpha\beta} is equal to a given matrix MiM_{i}; correspondingly, each subset 𝒦iβ\mathcal{K}^{\beta}_{i} contains all the permutations hh such that hAβαhA^{\beta\alpha} is equal to the matrix MiTM_{i}^{T}. We can then construct the group of symmetries of the multilayer network 𝒢\mathcal{G} as follows,

𝒢={(g00h)|g𝒦iα and h𝒦iβ, for i=1,,K}\mathcal{G}=\left\{\begin{pmatrix}g&0\\ 0&h\end{pmatrix}|g\in\mathcal{K}^{\alpha}_{i}\mbox{ and }h\in\mathcal{K}^{\beta}_{i},\mbox{ for }i=1,...,K\right\} (15)

Although the sets 𝒦iα\mathcal{K}^{\alpha}_{i} and 𝒦iβ\mathcal{K}^{\beta}_{i} have a one-to-one correspondence, the elements of each do not and often differ in number, as shown in Methods for the example multilayer network in Fig. 1.

Next, we present properties of the equivalence classes 𝒦iα\mathcal{K}^{\alpha}_{i}, which then leads to the definition of Independent Layer Symmetries (ILS). Let 𝒦1α\mathcal{K}^{\alpha}_{1} be the equivalence class containing the identity. We can prove that 𝒦1α\mathcal{K}^{\alpha}_{1} is a normal subgroup of α\mathcal{H}^{\alpha}. Moreover, we can prove that all the 𝒦iα\mathcal{K}^{\alpha}_{i}, i1i\neq 1, are left and right cosets of 𝒦1α\mathcal{K}^{\alpha}_{1}. Formal proofs for each statement are included in Methods (Formal Proofs.)

The structure of the equivalence classes 𝒦iα\mathcal{K}^{\alpha}_{i} gives insight into the symmetries; this facilitates the calculations of the classes themselves and of the TT matrices for each layer (see Methods for the structure of the TT matrix). In particular the subgroups 𝒦1α\mathcal{K}^{\alpha}_{1}, 𝒦1β\mathcal{K}^{\beta}_{1}, … identify a special set of symmetries we will refer to as Independent Layer Symmetries. The following general relationship between the symmetry operations from 𝒦1α\mathcal{K}^{\alpha}_{1}, 𝒦1β\mathcal{K}^{\beta}_{1},… and the layer structures clarifies why we refer to the elements of 𝒦1α\mathcal{K}^{\alpha}_{1}, 𝒦1β\mathcal{K}^{\beta}_{1},… as Independent Layer Symmetries. Given any g𝒦1αg\in\mathcal{K}^{\alpha}_{1}, then for each h𝒦1βh\in\mathcal{K}^{\beta}_{1},

Table 1: Symmetries of Real Multilayer Networks. For each network dataset, we include information on the number of layers MM, the number of nodes in each layer Nα,α=1,MN^{\alpha},\alpha=1,...M (the number of nodes 𝒩\mathcal{N} in all layers for multiplex networks), the number of edges EE, the order of the automorphism group |𝒢||\mathcal{G}|, and the cardinality of the largest orbital cluster max(|𝒞k|)\max(|\mathcal{C}_{k}|).
Name MM Number of nodes EE |𝒢||\mathcal{G}| max(|𝒞k|)\max(|\mathcal{C}_{k}|)
London Transport** [40] 3 𝒩=369\mathcal{N}=369 441 4 3
EU-AIR Transport [41] 37 𝒩=450\mathcal{N}=450 3588 1475532×10311475532\times 10^{31} 4
ARXIV NETSCIENCE** [42] 13 𝒩=14489\mathcal{N}=14489 59026 8349492×1021738349492\times 10^{2173} 16
PIERRE AUGER Coauthorship** [42] 16 𝒩=514\mathcal{N}=514 7153 19726×107019726\times 10^{70} 11
CKM PHYSICIANS Social [43] 3 𝒩=246\mathcal{N}=246 1551 120 2
BOS Genetic [44, 45] 4 𝒩=321\mathcal{N}=321 325 2×10902\times 10^{90} 25
CANDIDA Genetic [44, 45] 7 𝒩=367\mathcal{N}=367 397 2×104702\times 10^{470} 57
DANIORERIO Genetic [44, 45] 5 𝒩=155\mathcal{N}=155 188 798×1020798\times 10^{20} 12
US power-grid [46] 2 Nα=4492;Nβ=449N^{\alpha}=4492;N^{\beta}=449 6994 5×101525\times 10^{152} 9
  • *

    Network treated as undirected.

  • **

    Weighted Network but treated as unweighted.

gAαβ=Aαβh=Aαβ,gA^{\alpha\beta}=A^{\alpha\beta}h=A^{\alpha\beta}, (16)

since the equivalence class subgroups are both associated with the identity operation. This means that the symmetry operations from the equivalence class subgroups do not affect the interlayer coupling and, hence, those operations (permutations) in one layer do not affect the types of allowed dynamics in the other layer(s). In particular, the loss of a symmetry associated with the ILS subgroup in the dynamics, i.e. a symmetry-breaking bifurcation, will not alter the possible clusters in other layers, provided no symmetries in the other cosets (𝒦iα,i1\mathcal{K}^{\alpha}_{i},i\neq 1) are also broken. We will show simple examples of this in the Methods Section and when presenting the experiment. Note that the stability of the clusters is a different issue, which will receive separate consideration.

To conclude, the ILS clusters are determined by the interplay between the intralayer couplings in each layer and the interlayer couplings between layers. In what follows we will refer to symmetries that are not ILS, i.e. they involve simultaneously swapping nodes in different layers as Dependent Layer Symmetries (DLS).

From knowledge of the group of symmetries of the multilayer network, the nodes in each layer α\alpha can be partitioned into LαL^{\alpha} orbital clusters, 𝒞1α,𝒞2α,,𝒞Lαα\mathcal{C}^{\alpha}_{1},\mathcal{C}^{\alpha}_{2},...,\mathcal{C}^{\alpha}_{L^{\alpha}}. Inside each layer, symmetries map into each other only nodes in the same orbital cluster.

In Table 1 we apply the techniques described in this section to compute the symmetries of several multilayer networks from datasets in the literature. For each network dataset, we include information on the number of layers MM, the number of nodes in each layer Nα,α=1,MN^{\alpha},\alpha=1,...M (the number of nodes 𝒩\mathcal{N} in all layers for multiplex networks), the number of edges EE, the order of the automorphism group |𝒢||\mathcal{G}|, and the cardinality of the largest orbital cluster max(|𝒞k|)\max(|\mathcal{C}_{k}|). The main underlying assumption is that nodes are homogeneous inside each layer but nodes in different layers are not, so that nodes inside each layer can be symmetric, but nodes from different layers cannot. While we understand this is an oversimplification, available datasets do not typically include information on the attributes of the individual nodes, and as a result, our symmetry analysis is solely based on the multilayer network structure [37] and not on the specific node attributes. An extensive description of each one of the datasets is included in the Supplementary Note 1 and in the Supplementary Table 1. From Table 1 we see that several real multilayer networks possess very large numbers of symmetries.

In Supplementary Note 2 we study the emergence of symmetries in artificially generated multilayer networks, where each layer is a Scale Free (SF) network and nodes from different layers are randomly matched to one another to obtain a multiplex network. We see that these networks typically do not display symmetries, except for the case that the power-law degree distribution exponents of the networks in each layer are low across the layers. It is interesting that some of the real multilayer networks we have analyzed display many more symmetries than these model multilayer networks. This observation motivated us to design a generating algorithm to construct multilayer networks with prescribed number of symmetries, which is presented in Supplementary Note 3.

Stability Analysis

In what follows we study stability of the cluster-synchronous solution for a general multilayer network described by Eqs. (1). Given an orbital partition, we define the Lα×Lα{L^{\alpha}}\times{L^{\alpha}} intralayer quotient matrix QααQ^{\alpha\alpha} such that for each pair of α\alpha-clusters (𝒞uα,𝒞vα\mathcal{C}^{\alpha}_{u},\mathcal{C}^{\alpha}_{v}),

Quvαα=j𝒞vαAijαα,i𝒞uα,u,v=1,2,Lα.Q^{\alpha\alpha}_{uv}=\sum_{j\in\mathcal{C}^{\alpha}_{v}}A^{\alpha\alpha}_{ij},\qquad i\in\mathcal{C}^{\alpha}_{u},\quad u,v=1,2,\dots L^{\alpha}. (17)

Analogously, we define the Lα×Lβ{L^{\alpha}}\times{L^{\beta}} interlayer quotient matrix QαβQ^{\alpha\beta} such that for each pair of clusters, the first cluster 𝒞uα{\mathcal{C}}^{\alpha}_{u} from layer α\alpha and the second cluster 𝒞vβ{\mathcal{C}}^{\beta}_{v} from layer β\beta,

Quvαβ=j𝒞vβAijαβ,i𝒞uα,u=1,2,Lα,v=1,2,Lβ.Q^{\alpha\beta}_{uv}=\sum_{j\in\mathcal{C}^{\beta}_{v}}A^{\alpha\beta}_{ij},\qquad i\in\mathcal{C}^{\alpha}_{u},\quad u=1,2,\dots L^{\alpha},v=1,2,\dots L^{\beta}. (18)

We can thus write the equations for the time evolution of the quotient multilayer network,

𝐪˙uα=𝐅α(𝐪uα)+σααv=1LαQuvαα𝐇αα(𝐪vα)+βασαβv=1LβQuvαβ𝐇αβ(𝐪vβ),\dot{\bf q}_{u}^{\alpha}={\bf F}^{\alpha}({\bf q}_{u}^{\alpha})+{\sigma^{\alpha\alpha}\sum_{v=1}^{L^{\alpha}}Q^{\alpha\alpha}_{uv}{\bf H}^{\alpha\alpha}({\bf q}_{v}^{\alpha})}+{\sum_{\beta\neq\alpha}\sigma^{\alpha\beta}\sum_{v=1}^{L^{\beta}}Q^{\alpha\beta}_{uv}{\bf H}^{\alpha\beta}({\bf q}_{v}^{\beta})}, (19)

α=1,,M\alpha=1,...,M, u=1,,Lαu=1,...,L^{\alpha}. Note that Eqs. (19) provides a mapping for each layer α\alpha from the node coordinates {𝐱iα}\{{\bf x}_{i}^{\alpha}\}, i=1,,Nαi=1,...,N^{\alpha} to the quotient coordinates {𝐪uα}\{{\bf q}_{u}^{\alpha}\}, u=1,,Lαu=1,...,L^{\alpha}, where 𝐱iα(t)𝐪uα(t){\bf x}_{i}^{\alpha}(t)\equiv{\bf q}_{u}^{\alpha}(t) if i𝒞uαi\in\mathcal{C}_{u}^{\alpha}.

We now linearize (1) about (19),

δ𝐱˙iα=DFα(𝐪uα)δ𝐱iα+βσαβj=1NβAijαβDHαβ(𝐪vβ)δ𝐱jβ,i=1,,Nα,\delta\dot{{\bf x}}_{i}^{\alpha}=DF^{\alpha}({\bf q}_{u}^{\alpha})\delta{{\bf x}}_{i}^{\alpha}+{\sum_{\beta}\sigma^{\alpha\beta}\sum_{j=1}^{N^{\beta}}A^{\alpha\beta}_{ij}DH^{\alpha\beta}({\bf q}_{v}^{\beta})\delta{\bf x}_{j}^{\beta}},\qquad i=1,...,N^{\alpha}, (20)

where again 𝐪vβ{\bf q}_{v}^{\beta} is the time evolution of the quotient network node vv that node j𝒞vβj\in{\mathcal{C}}_{v}^{\beta} maps to. Also note that in the above equation the summation in β\beta runs over both intra-layer connections and inter-layer connections.

For each layer α\alpha, the above set of equations, can be written in vectorial form, by stacking together all the individual perturbations applied to the vectors inside each layer, e.g., δ𝐱α=[δ𝐱1α,δ𝐱2α,,δ𝐱Nαα]\delta{\bf x}^{\alpha}=[\delta{\bf x}_{1}^{\alpha},\delta{\bf x}_{2}^{\alpha},...,\delta{\bf x}_{N^{\alpha}}^{\alpha}],

δ𝐱˙α=(u=1LαEuαDFα(𝐪uα))δ𝐱α+β(σαβ(AαβInα)u=1Lβ(EuβDHαβ(𝐪uβ)))δ𝐱β,\delta\dot{\bf x}^{\alpha}=\left(\sum_{u=1}^{L^{\alpha}}E_{u}^{\alpha}\otimes DF^{\alpha}({\bf q}_{u}^{\alpha})\right)\delta{\bf x}^{\alpha}+\sum_{\beta}\left(\sigma^{\alpha\beta}(A^{\alpha\beta}\otimes I_{n^{\alpha}})\sum_{u=1}^{L^{\beta}}\left(E^{\beta}_{u}\otimes DH^{\alpha\beta}({\bf q}_{u}^{\beta})\right)\right)\delta{\bf x}^{\beta}, (21)

α=1,,M,\alpha=1,...,M, where each indicator matrix EuαE_{u}^{\alpha} has dimension NαN^{\alpha} and is such that its diagonal entries are equal to one if node ii of layer α\alpha is in cluster 𝒞uα{\mathcal{C}_{u}^{\alpha}} and are equal to zero otherwise.

We then stack all the layers one above the other to form the vector δ𝐱=[δ𝐱α,δ𝐱β,]\delta{\bf x}=[\delta{\bf x}^{\alpha},\delta{\bf x}^{\beta},\dots], and we rewrite (21) as

δ𝐱˙=([uEuαDFα(𝐪uα)00uEuβDFβ(𝐪uβ)]+[uAααEuαDH^αα(𝐪uα)uAαβEuβDH^αβ(𝐪uβ)uAβαEuαDH^βα(𝐪uβ)uAββEuβDH^ββ(𝐪uβ)])δ𝐱,\begin{split}\delta\dot{\bf x}=&\left(\begin{bmatrix}\sum_{u}E_{u}^{\alpha}\otimes DF^{\alpha}({\bf q}_{u}^{\alpha})&0&\cdots\\ 0&\sum_{u}E_{u}^{\beta}\otimes DF^{\beta}({\bf q}_{u}^{\beta})&\cdots\\ \vdots&\vdots&\ddots\end{bmatrix}\right.\\ \ +&\left.\begin{bmatrix}\sum_{u}A^{\alpha\alpha}E^{\alpha}_{u}\otimes D\hat{H}^{\alpha\alpha}({\bf q}_{u}^{\alpha})&\sum_{u}A^{\alpha\beta}E^{\beta}_{u}\otimes D\hat{H}^{\alpha\beta}({\bf q}_{u}^{\beta})&\cdots\\ \sum_{u}A^{\beta\alpha}E^{\alpha}_{u}\otimes D\hat{H}^{\beta\alpha}({\bf q}_{u}^{\beta})&\sum_{u}A^{\beta\beta}E^{\beta}_{u}\otimes D\hat{H}^{\beta\beta}({\bf q}_{u}^{\beta})&\cdots\\ \vdots&\vdots&\ddots\end{bmatrix}\right)\delta{\bf x},\end{split} (22)

where DH^αβ=σαβDHαβD\hat{H}^{\alpha\beta}=\sigma^{\alpha\beta}DH^{\alpha\beta}.

We are looking for a transformation that applied to Eq. (22), leaves the first terms on the right hand side of (22) unchanged and decouples the second terms in independent blocks, independent of the DFDF and the DHDH terms as they vary in time.

From knowledge of the group of symmetries of the multilayer network 𝒢\mathcal{G}, we can compute the irreducible representations (IRRs) of 𝒢\mathcal{G}. For each layer α\alpha we can define an orthonormal transformation TαT^{\alpha} to the IRR coordinate system (see [20]). We can then construct the following block diagonal orthonormal matrix,

T=αTα,T=\bigoplus_{\alpha}T^{\alpha}, (23)

that maps the entire multilayer network to the IRR coordinate system.

A formal proof of the above particular structure of the matrix TT can be found in Methods (Properties of the Equivalence Classes and structure of the matrix TT). Intuitively, the matrix TT has a block diagonal structure, where each block corresponds to a layer, because only nodes from the same layer can be swapped by a symmetry.

Consider now the NN-dimensional supra-adjacency matrix,

A=[AααAαβAβαAββ].A=\begin{bmatrix}A^{\alpha\alpha}&A^{\alpha\beta}&\cdots\\ A^{\beta\alpha}&A^{\beta\beta}&\cdots\\ \vdots&\vdots&\ddots\end{bmatrix}. (24)

The transformed N×NN\times N block diagonal matrix B=TAT1B=TAT^{-1} is a direct sum r=1RIdrB^r\oplus_{r=1}^{R}I_{d_{r}}\otimes\hat{B}_{r}, where B^r\hat{B}_{r} is a (generally complex) pr×prp_{r}\times p_{r} matrix with prp_{r} the multiplicity of the rrth IRR in the permutation representation, RR the number of IRRs present and drd_{r} the dimension of the rrth IRR, so that rdrpr=N\sum_{r}d_{r}p_{r}=N. The matrix TT contains information on which perturbations affecting different clusters get mapped to different IRRs [24]. There is one representation (labeled r=1r=1) which we call trivial and has dimension d1=αLαd_{1}=\sum_{\alpha}L^{\alpha}. All perturbations parallel to the synchronization manifold get mapped to this representation. Hence, the trivial representation is associated with all the clusters 𝒞11,,𝒞L11,𝒞12,,𝒞L22,\mathcal{C}^{1}_{1},...,\mathcal{C}^{1}_{L^{1}},\mathcal{C}^{2}_{1},...,\mathcal{C}^{2}_{L^{2}},... However, it is possible that other IRR representations are only associated with some of the clusters (not all of them).

We can now define the αNαnα\sum_{\alpha}N^{\alpha}n^{\alpha}-dimensional orthonormal matrix T~=αTαInα{\tilde{T}}=\bigoplus_{\alpha}T^{\alpha}\otimes I_{n_{\alpha}}. Next, we will use the matrix T~\tilde{T} to block-diagonalize Eq. (21). Applying the transformation 𝜼=T~δ𝐱\text{\boldmath$\eta$}={\tilde{T}}\delta{\bf x} to (22) we obtain,

𝜼˙=([uJuαDFα(𝐪uα)00uJuβDFβ(𝐪uβ)]+[uBααJuαDH^αα(𝐪uα)uBαβJuβDH^αβ(𝐪uβ)uBβαJuαDH^βα(𝐪uβ)uBββJuβDH^ββ(𝐪uβ)])𝜼,\begin{split}\dot{\text{\boldmath$\eta$}}=&\left(\begin{bmatrix}\sum_{u}J_{u}^{\alpha}\otimes DF^{\alpha}({\bf q}_{u}^{\alpha})&0&\cdots\\ 0&\sum_{u}J_{u}^{\beta}\otimes DF^{\beta}({\bf q}_{u}^{\beta})&\cdots\\ \vdots&\vdots&\ddots\end{bmatrix}\right.\\ \ +&\left.\begin{bmatrix}\sum_{u}B^{\alpha\alpha}J^{\alpha}_{u}\otimes D\hat{H}^{\alpha\alpha}({\bf q}_{u}^{\alpha})&\sum_{u}B^{\alpha\beta}J^{\beta}_{u}\otimes D\hat{H}^{\alpha\beta}({\bf q}_{u}^{\beta})&\cdots\\ \sum_{u}B^{\beta\alpha}J^{\alpha}_{u}\otimes D\hat{H}^{\beta\alpha}({\bf q}_{u}^{\beta})&\sum_{u}B^{\beta\beta}J^{\beta}_{u}\otimes D\hat{H}^{\beta\beta}({\bf q}_{u}^{\beta})&\cdots\\ \vdots&\vdots&\ddots\end{bmatrix}\right)\text{\boldmath$\eta$},\end{split} (25)

where each transformed indicator matrix Juα=TαEuαTαTJ_{u}^{\alpha}=T^{\alpha}E_{u}^{\alpha}{T^{\alpha}}^{T} and each block Bαβ=TαAαβTβT.B^{\alpha\beta}={T^{\alpha}}A^{\alpha\beta}{T^{\beta}}^{T}.

The advantage of (25) over (22) lies in the block-diagonal structure of the matrix B=r=1RIdrB^rB=\oplus_{r=1}^{R}I_{d_{r}}\otimes\hat{B}_{r}. The block B^1\hat{B}_{1} is associated with motion along the synchronization manifold. The blocks B^2,,B^R\hat{B}_{2},...,\hat{B}_{R} describe the dynamics transverse to the synchronization manifold. As a result, we have decoupled the dynamics along the synchronous manifold from that transverse to it [20]. Moreover, each transverse block r=2,..,Rr=2,..,R is associated with either an individual cluster or a subset of intertwined clusters [20]. Thus the problem of studying the behavior of a perturbation away from the synchronous solution is typically reduced into many smaller problems, which can be analyzed independently one from the other.

Next we discuss how Dependent and Independent Layer Symmetries affect the stability analysis. We recall that the matrix B=TAT1B=TAT^{-1} can be written as a direct sum of blocks r=1RIdrB^r\oplus_{r=1}^{R}I_{d_{r}}\otimes\hat{B}_{r}. As each row of the matrix TT is associated to a specific cluster [47], each one of the blocks B^r\hat{B}_{r} corresponds to a set of clusters which are identified by the rows of the matrix TT. The trivial representation (r=1r=1) is associated with all the clusters 𝒞11,,𝒞L11,𝒞12,,𝒞L22,\mathcal{C}^{1}_{1},...,\mathcal{C}^{1}_{L^{1}},\mathcal{C}^{2}_{1},...,\mathcal{C}^{2}_{L^{2}},... The corresponding rows of the matrix TT are the eigenvectors associated to the eigenvalue 1 of the trivial representation; these have nonzero components all of the same sign. Now we look at the remaining ‘transverse’ blocks of the matrix BB (r>1r>1). The corresponding rows of the matrix TT are such that the sums of their entries is equal zero and are called symmetry breakings: each row, in fact, describes how a cluster, generated by a symmetry, may break into smaller ones. The transverse blocks can be divided into ILS blocks if the corresponding symmetry breakings are all from the same layer and DLS blocks if the corresponding symmetry breakings are from different layers. We can then write T=[T SYNCT,T ILST,TDLST]TT=[T_{\text{ SYNC}}^{T},T_{\text{ ILS}}^{T},T_{\text{DLS}}^{T}]^{T} and the transformed vector 𝜼=[𝜼SYNCT,𝜼ILST,𝜼DLST]T\text{\boldmath$\eta$}=[\text{\boldmath$\eta$}_{\text{SYNC}}^{T},\text{\boldmath$\eta$}_{\text{ILS}}^{T},\text{\boldmath$\eta$}_{\text{DLS}}^{T}]^{T}.

The ILS blocks are symmetry breakings generated by the ILS subgroup. From our definition of the ILS subgroup, each 𝒦1α\mathcal{K}_{1}^{\alpha} is a normal subgroup of α\mathcal{H}^{\alpha}. Clifford theorem [48] states that each IRR of α\mathcal{H}^{\alpha}, when restricted on 𝒦1α\mathcal{K}_{1}^{\alpha}, is either itself an IRR of 𝒦1α\mathcal{K}_{1}^{\alpha} or breaks up into a direct sum of IRRs of 𝒦1α\mathcal{K}_{1}^{\alpha} of the same dimension. The rows of the change of coordinates TILSαT_{\text{ILS}}^{\alpha} (for layer α\alpha) to the IRR of 𝒦1α\mathcal{K}_{1}^{\alpha}, which are associated with the symmetry breaking perturbations of the ILS, are generated by the eigenvectors associated to the eigenvalue 1 of the projectors on the IRRs of 𝒦1α\mathcal{K}_{1}^{\alpha}. These rows generate invariant subspaces of minimal dimension, and must therefore be rows of TαT^{\alpha}.

We now consider for simplicity the case of a network with two layers, labeled α\alpha and β\beta. In general, the transverse IRRs associated with the ILS subgroup in layer α\alpha will have structure,

𝜼˙ILS=[uJuαDFα(𝐪uα)+uBααJuαDH^αα(𝐪uα)]𝜼ILS.\dot{\text{\boldmath$\eta$}}_{{\text{ILS}}}=\Bigl{[}\sum_{u}J_{u}^{\alpha}\otimes DF^{\alpha}({\bf q}_{u}^{\alpha})+\sum_{u}B^{\alpha\alpha}J^{\alpha}_{u}\otimes D\hat{H}^{\alpha\alpha}({\bf q}_{u}^{\alpha})\Bigr{]}\text{\boldmath$\eta$}_{{\text{ILS}}}. (26)

Note the perturbation 𝜼ILS\text{\boldmath$\eta$}_{{\text{ILS}}} is independent of the dynamics on the β\beta layer, i.e., of both DFβ(𝐪uβ)DF^{\beta}({\bf q}_{u}^{\beta}) and DH^ββ(𝐪uβ)D\hat{H}^{\beta\beta}({\bf q}_{u}^{\beta}). This indicates that the stability of ILS symmetries can be studied through a specific class of the Master Stability Function, which is the same as for single-layer networks [20]. The transverse IRRs associated with the ILS subgroup in layer β\beta will have an analogous structure as (26). On the other hand, the remaining transverse IRRs will have structure,

𝜼˙DLS=([uJuαDFα(𝐪uα)00uJuβDFβ(𝐪uβ)]+[uBααJuαDH^αα(𝐪uα)uBαβJuβDH^αβ(𝐪uβ)uBβαJuαDH^βα(𝐪uβ)uBββJuβDH^ββ(𝐪uβ)])𝜼DLS.\begin{split}\dot{\text{\boldmath$\eta$}}_{{\text{DLS}}}=&\left(\begin{bmatrix}\sum_{u}J_{u}^{\alpha}\otimes DF^{\alpha}({\bf q}_{u}^{\alpha})&0\\ 0&\sum_{u}J_{u}^{\beta}\otimes DF^{\beta}({\bf q}_{u}^{\beta})\end{bmatrix}\right.\\ \ +&\left.\begin{bmatrix}\sum_{u}B^{\alpha\alpha}J^{\alpha}_{u}\otimes D\hat{H}^{\alpha\alpha}({\bf q}_{u}^{\alpha})&\sum_{u}B^{\alpha\beta}J^{\beta}_{u}\otimes D\hat{H}^{\alpha\beta}({\bf q}_{u}^{\beta})\\ \sum_{u}B^{\beta\alpha}J^{\alpha}_{u}\otimes D\hat{H}^{\beta\alpha}({\bf q}_{u}^{\beta})&\sum_{u}B^{\beta\beta}J^{\beta}_{u}\otimes D\hat{H}^{\beta\beta}({\bf q}_{u}^{\beta})\\ \end{bmatrix}\right)\text{\boldmath$\eta$}_{{\text{DLS}}}.\end{split} (27)

Note that the perturbations 𝜼DLS\text{\boldmath$\eta$}_{{\text{DLS}}} depend on the dynamics of the systems in both layers α\alpha and β\beta, through the mixed blocks appearing in Eq. (27). The structure of Eq. (27) is substantially different than that of Eq. (26), which may lead to dramatic effects in terms of stability.

Consider now the multilalyer network in Fig. 1. The matrix TT is equal to

T=[0.50.50.50.50000000010000000012012000000100.50.50.50.500000.50.50.50.500000.50.50.50.500000000012012]}SYNC}ILS breakings}DLS breakingsT=\left[\begin{array}[]{cccccccc}0.5&0.5&0.5&0.5&0&0&0&0\\ 0&0&0&0&1&0&0&0\\ 0&0&0&0&0&\frac{1}{\sqrt{2}}&0&\frac{1}{\sqrt{2}}\\ 0&0&0&0&0&0&1&0\\ \hline\cr 0.5&-0.5&0.5&-0.5&0&0&0&0\\ 0.5&-0.5&-0.5&0.5&0&0&0&0\\ \hline\cr 0.5&0.5&-0.5&-0.5&0&0&0&0\\ 0&0&0&0&0&\frac{1}{\sqrt{2}}&0&-\frac{1}{\sqrt{2}}\end{array}\right]\begin{array}[]{l}\left.\begin{array}[]{l}\\ \\ \\ \\ \end{array}\right\}\text{SYNC}\\ \left.\begin{array}[]{l}\\ \\ \end{array}\right\}\text{ILS breakings}\\ \left.\begin{array}[]{l}\\ \\ \end{array}\right\}\text{DLS breakings}\end{array} (28)

The matrix B=TATTB=TAT^{T} is equal to:

B=[2220000020000000200200000020000000002000000000000000000200000020]}SYNC block}ILS blocks}DLS blockB=\left[\begin{array}[]{cccc|cc|cc}2&2&\sqrt{2}&0&0&0&0&0\\ 2&0&0&0&0&0&0&0\\ \sqrt{2}&0&0&\sqrt{2}&0&0&0&0\\ 0&0&\sqrt{2}&0&0&0&0&0\\ \hline\cr 0&0&0&0&-2&0&0&0\\ 0&0&0&0&0&0&0&0\\ \hline\cr 0&0&0&0&0&0&0&\sqrt{2}\\ 0&0&0&0&0&0&\sqrt{2}&0\\ \end{array}\right]\begin{array}[]{l}\left.\begin{array}[]{l}\\ \\ \\ \\ \end{array}\right\}\text{SYNC block}\\ \left.\begin{array}[]{l}\\ \\ \end{array}\right\}\text{ILS blocks}\\ \left.\begin{array}[]{l}\\ \\ \end{array}\right\}\text{DLS block}\end{array} (29)

As can be seen, the matrix BB is the direct sum of one SYNC block, two independent ILS blocks (corresponding to breakings in the α\alpha layer which are independent of the β\beta layer), and one DLS block (corresponding to breakings in the α\alpha layer and in the β\beta layer which are dependent on each other.) The transverse ILS and DLS blocks describe linear (local) stability of clusters, when the dynamics is linearized about the quotient network time evolution. In what follows we will pay particular attention to stability of DLS blocks, which are a specific feature of multilayer networks.

To provide analytical insight, we first consider a two-layer network described by the following discrete-time dynamics,

𝐱αk+1=rem(cα𝐱αk+σAαα𝐱αk+σAαβ𝐱βk)𝐱βk+1=rem(cβ𝐱βk+σAββ𝐱βk+σAβα𝐱αk),\begin{array}[]{rcl}{\bf{x}^{\alpha}}^{k+1}&=&\mbox{rem}(c^{\alpha}{\bf{x}^{\alpha}}^{k}+\sigma A^{\alpha\alpha}{\bf{x}^{\alpha}}^{k}+\sigma A^{\alpha\beta}{\bf{x}^{\beta}}^{k})\\ {\bf{x}^{\beta}}^{k+1}&=&\mbox{rem}(c^{\beta}{\bf{x}^{\beta}}^{k}+\sigma A^{\beta\beta}{\bf{x}^{\beta}}^{k}+\sigma A^{\beta\alpha}{\bf{x}^{\alpha}}^{k}),\end{array} (30)

where the vectorial function rem(𝐱)\mbox{rem}({\bf{x}}) returns a vector whose entries are the remainder of the integer division of the entries of the vector 𝐱{\bf{x}} by the scalar 11 and cαc^{\alpha} and cβc^{\beta} are tunable layer-specific scalar parameters.

Stability is described by the following set of equations,

δ𝐱αk+1=cαδ𝐱αk+σAααδ𝐱αk+σAαβδ𝐱βkδ𝐱βk+1=cβδ𝐱βk+σAββδ𝐱βk+σAβαδ𝐱αk.\begin{array}[]{rcl}\delta{\bf{x}^{\alpha}}^{k+1}&=&c^{\alpha}{\delta\bf{x}^{\alpha}}^{k}+\sigma A^{\alpha\alpha}{\delta\bf{x}^{\alpha}}^{k}+\sigma A^{\alpha\beta}{\delta\bf{x}^{\beta}}^{k}\\ \delta{\bf{x}^{\beta}}^{k+1}&=&c^{\beta}{\delta\bf{x}^{\beta}}^{k}+\sigma A^{\beta\beta}{\delta\bf{x}^{\beta}}^{k}+\sigma A^{\beta\alpha}{\delta\bf{x}^{\alpha}}^{k}.\end{array} (31)

We now consider a generic DLS block of the form (abba)\begin{pmatrix}a&b\\ b&a\end{pmatrix} (a=0a=0 and b=2b=\sqrt{2} in the DLS block of Eq. (29)), to which corresponds a perturbation of the form,

𝜼DLSk+1=(cα+σaσbσbcβ+σa)𝜼DLSk,{\text{\boldmath$\eta$}}_{{\text{DLS}}}^{k+1}=\left(\begin{matrix}c^{\alpha}+\sigma a&\sigma b\\ \sigma b&c^{\beta}+\sigma a\\ \end{matrix}\right)\text{\boldmath$\eta$}_{{\text{DLS}}}^{k}, (32)

with cαcβc^{\alpha}\neq c^{\beta} and the case cα=cβc^{\alpha}=c^{\beta} corresponding to an ILS perturbation. The eigenvalues have the following expression,

ρ±=c¯+aσ±(b2σ2+δc2)1/2,\rho^{\pm}=\bar{c}+a\sigma\pm(b^{2}\sigma^{2}+\delta_{c}^{2})^{1/2}, (33)

where c¯=(cβ+cα)/2\bar{c}=(c^{\beta}+c^{\alpha})/2 is the average layer-specific parameter and δc=(cβcα)/2\delta_{c}=(c^{\beta}-c^{\alpha})/2 measures how different are the systems in the two layers (with δc=0\delta_{c}=0 corresponding to the case of an ILS.) From this equation we see the larger (smaller) eigenvalue is an increasing (decreasing) function of δc\delta_{c}, and it follows that the best condition in terms of stability is achieved for δc=0\delta_{c}=0. We thus conclude that DLS perturbations are more difficult to stabilize than ILS perturbations.

We present here a conjecture expanding on the above conclusion: that DLS clusters are generally more difficult to stabilize compared to the case in which the systems in different layers are of the same type. We base this on the following reasoning. Consider an ideal situation in which at first the parameters of the systems in the different layers are identical and then they are increasingly perturbed to take on different values in different layers. The Gershgorin circle’s theorem states that each eigenvalue of a matrix lies within at least one of the Gershgorin discs centered at the entries on the main diagonal and having radius equal to the sum of the off diagonal entries. As perturbing the individual system’s parameters corresponds to varying the centers of the Gershgorin discs (but not the radius), we can expect the eigenvalues to become increasingly spread out as the systems are made increasingly different from one another, resulting in reduced stability.

The particular network in Fig. 1 has one transverse irreducible representation (DLS) in the form of Eq. (32), with a=0a=0 and b=2b=\sqrt{2}, corresponding to simultaneous loss of synchronization between nodes (1,3)(1,3) in the β\beta layer and between the pairs of nodes (1,2)(1,2) and (3,4)(3,4) in the α\alpha layer. For this multilayer network, we consider the dynamics of Eq. (30) and study the effects of changing the parameters cαc^{\alpha} and cβc^{\beta} on stability. For the maps described by Eq. (30), as well as in the following for other kind of systems, we measure the pairwise synchronization error, defined as,

Eijα=<𝐱iα𝐱jα>,E^{\alpha}_{ij}=<\|{\bf{x}}^{\alpha}_{i}-{\bf{x}}^{\alpha}_{j}\|>, (34)

between nodes ii and jj in layer α=1,,M\alpha=1,...,M, where the symbol <><...> indicates a temporal average, computed after the transient has elapsed.

Panel a of Fig. 2 shows E13αE_{13}^{\alpha} and E13βE_{13}^{\beta} vs the parameter δc\delta_{c}. δc=0\delta_{c}=0 corresponds to identical systems in the two layers, increasing values of δc\delta_{c} indicate the systems in the two layers are increasingly different. Synchronization is simultaneously lost in both layers for δc0.35\delta_{c}\gtrapprox 0.35. Panel b is a plot of the eigenvalues ρ+\rho^{+} and ρ\rho^{-} in Eq. (33) as a function of δc\delta_{c}, which shows that ρ+\rho^{+} (ρ\rho^{-}) increases (decreases) with δc\delta_{c}. Loss of stability occurs when either one of the two eigenvalues is either larger than 11 or smaller than 1-1. It is thus expected that stability may be lost for increasing values of δc\delta_{c}, i.e., as the systems in the two layers become increasingly different. From Panel b of Fig. 2 we see that ρ+\rho^{+} grows larger than 11 for δc0.35\delta_{c}\gtrapprox 0.35.

Refer to caption
Figure 2: Synchronization of DLS clusters. a Discrete time maps. Synchronization errors E13αE_{13}^{\alpha} (asterisks) and E13βE_{13}^{\beta} (diamonds) vs the parameter δc\delta_{c}. δc=0\delta_{c}=0 corresponds to identical systems between the α\alpha and in the β\beta layers. Increasing values of δc\delta_{c} are for increasingly different systems in the two layers. Synchronization is lost in both layers for δc0.35\delta_{c}\gtrapprox 0.35. b Discrete time maps. Eigenvalues ρ+\rho^{+} and ρ\rho^{-} in Eq. (33). As can be seen, ρ+\rho^{+} (ρ\rho^{-}) increases (decreases) with δc\delta_{c}. Loss of stability occurs when either one of the two eigenvalues is either larger than 11 or smaller than 1-1. ρ+\rho^{+} becomes larger than 11 for δc0.35\delta_{c}\gtrapprox 0.35. c Van Der Pol oscillators. Synchronization errors E13αE_{13}^{\alpha} (asterisks) and E13βE_{13}^{\beta} (diamonds) vs the parameter δc\delta_{c}. δc=0\delta_{c}=0 corresponds to identical systems between the α\alpha and in the β\beta layers. Increasing values of δc\delta_{c} are for increasingly different systems in the two layers. Synchronization is lost in both layers for δc0.4\delta_{c}\gtrapprox 0.4. d Van Der Pol oscillators. Maximum Lyapunov Exponent of the DLS block (27) vs the parameter δc\delta_{c}.

We then consider the case of Eqs. (1) with M=2M=2 layers, Aαα,Aββ,Aαβ=(Aβα)TA^{\alpha\alpha},A^{\beta\beta},A^{\alpha\beta}=(A^{\beta\alpha})^{T} corresponding to the multilayer network in Fig. 1, nα=nβ=2n^{\alpha}=n^{\beta}=2, 𝐱α=[xα,yα]{\bf x}^{\alpha}=[{x}^{\alpha},{y}^{\alpha}], 𝐱β=[xβ,yβ]{\bf x}^{\beta}=[{x}^{\beta},{y}^{\beta}],

𝐅α(𝐱α)=[yαxα0.2yα[(xα)2cα]],𝐅β(𝐱β)=[yβxβ0.2yβ[(xβ)2cβ]],{\bf F}^{\alpha}({\bf x}^{\alpha})=\left[\begin{array}[]{c}y^{\alpha}\\ -x^{\alpha}-0.2y^{\alpha}[(x^{\alpha})^{2}-c^{\alpha}]\end{array}\right],\quad\quad{\bf F}^{\beta}({\bf x}^{\beta})=\left[\begin{array}[]{c}y^{\beta}\\ -x^{\beta}-0.2y^{\beta}[(x^{\beta})^{2}-c^{\beta}]\end{array}\right], (35)

which both correspond to the dynamics of the Van der Pol oscillator, with layer-dependent parameters cαc^{\alpha} and cβc^{\beta}. Moreover, we set

𝐇αβ(𝐱)=(1000)𝐱,{\bf H}^{\alpha\beta}({\bf x})=\begin{pmatrix}-1&0\\ 0&0\end{pmatrix}{\bf x}, (36)

for all pairs α,β=1,2\alpha,\beta=1,2 and σαβ=0.15\sigma^{\alpha\beta}=0.15 for all pairs α,β=1,2\alpha,\beta=1,2. We set the layer-dependent parameters cα=(1+δc)c^{\alpha}=(1+\delta_{c}) and cβ=(1δc)c^{\beta}=(1-\delta_{c}), so that δc=0\delta_{c}=0 corresponds to identical systems in the two layers and increasing values of δc\delta_{c} indicate the systems in the two layers are increasingly different. We then numerically investigate stability of the DLS as the parameter δc\delta_{c} is increased. This can be seen in panel c of Fig. 2, which shows that synchronization between oscillators 11 and 33 from the α\alpha layer and synchronization between oscillators 11 and 33 from the β\beta layer is simultaneously lost for δc0.4\delta_{c}\gtrapprox 0.4. Panel d of Fig. 2 shows the numerically computed Maximum Lyapunov exponent of the DLS block (27). We also note that throughout the whole δc\delta_{c} interval considered, neither nodes 11 and 22, nor nodes 11 and 44 from the α\alpha layer ever synchronize (not shown). Overall, Fig. 2 shows that increased heterogeneity between the nodes in the two layers, can lead to loss of DLS stability. Further numerical evidence of this is presented for the cases of the Lorenz oscillator and of the Roessler oscillator in Supplementary Note 4. Supplementary Note 5 investigates how varying the intra-layer and inter-layer coupling strengths affects CS stability.

An experimental testbed for cluster synchronization

We apply the techniques from the previous sections on an experimental testbed circuit. We implement three different kinds of electronic oscillators, using widely available, affordable components that can be assembled on breadboards. Simplicity, low-cost, ease of fabrication and availability of a large volume of previous studies make electronic circuits an ideal testbed for multilayer network studies [31]. The circuit is composed of three different kinds/layers of nodes: one linear resonator, which we call the “jumper”, two FitzHugh-Nagumo (FHN) oscillators, and four Colpitts oscillators. The jumper is a linear resonator (i.e., without input, its oscillations damp to zero) with two-dimensional governing equations; the FHN is a relaxational nonlinear oscillator with two-dimensional governing equations [49]; the Colpitts is a sinusoidal nonlinear oscillator with three-dimensional governing equations [50]. All three kinds of nodes have similar uncoupled frequencies. A full schematic of the experimental circuit is included in Figure 3. Figure 3 also states the measured parameter values of each component.

Figure 4 shows a simplified multilayer schematic of the circuit with the jumper as the α\alpha layer, the FHNs as the β\beta layer, and the Colpitts as the γ\gamma layer. We couple the different oscillators in three ways. On the Colpitts layer, we induce inductive coupling through mutual inductance, red in Fig.  4. Between the Colpitts layer and the FHN layer we introduce resistive coupling; this couples each FHN circuit with two Colpitts, blue in Fig.  4. Between the FHN and jumper layer, we induce inductive coupling between each FHN and an inductor in the jumper, orange in Fig.  4.

Refer to caption
Figure 3: Schematic of the experimental setup. RC=2.2kΩ.R_{C}=2.2k\Omega. We vary the magnetic coupling between Colpitts 1 and 2 and Colpitts 3 and 4, kCk_{C}, from 0.40.4-0.4-0.4 by varying separation xx (red). We hold the separation between the FHNs and the jumper (x in orange) constant such that the coefficient of mutual inductance, kFJk_{FJ}, is maintained equal to 0.35.
Refer to caption
Figure 4: Multilayer representation of the experimental circuit. Layer α\alpha contains the jumper node. Layer β\beta contains two FHN oscillators. Layer γ\gamma contains four Colpitts oscillators with inductive intralayer coupling shown in red. The interlayer resistive coupling between the β\beta and γ\gamma layers is shown in blue. The interlayer inductive coupling between the α\alpha and β\beta layers is shown in orange; this coupling introduces a virtual FHN intralayer coupling which we discuss in the analysis of the system.

As shown in the above schematic and equations, we can describe the system with three layers composed as follows. Layer α\alpha includes the jumper alone, layer β\beta includes 2 FHNs and the intra-layer connections, with 𝒢β={(),(1,2)}\mathcal{G}^{\beta}=\{(),(1,2)\} and layer γ\gamma includes 4 Colpitts and one intra-layer connection that connects nodes 1 with 2, and nodes 3 with 4. The group of symmetries of this layer is

𝒢γ={(),(1,2),(3,4),(1,2)(3,4),(1,3)(2,4),(1,4)(2,3)}.\mathcal{G}^{\gamma}=\{(),(1,2),(3,4),(1,2)(3,4),(1,3)(2,4),(1,4)(2,3)\}. (37)

We have the inter-layer connections:

Aαβ=[11]=(Aβα)T,Aβγ=[11000011]=(Aγβ)T.A^{\alpha\beta}=\begin{bmatrix}1&1\end{bmatrix}=(A^{\beta\alpha})^{T},\qquad A^{\beta\gamma}=\begin{bmatrix}1&1&0&0\\ 0&0&1&1\end{bmatrix}=(A^{\gamma\beta})^{T}. (38)

All the permutations in the groups 𝒢α,𝒢β,𝒢γ\mathcal{G}^{\alpha},\ \mathcal{G}^{\beta},\ \mathcal{G}^{\gamma} are compatible, then α=𝒢α\mathcal{H}^{\alpha}=\mathcal{G}^{\alpha}, β=𝒢β\mathcal{H}^{\beta}=\mathcal{G}^{\beta}, γ=𝒢γ.\mathcal{H}^{\gamma}=\mathcal{G}^{\gamma}.

The interlayer connections define the conjugate classes

𝒦α=();𝒦1β=(),𝒦2β=(1,2);𝒦1γ={(),(1,2),(3,4),(1,2)(3,4)},𝒦2γ={(1,3)(2,4),(1,4)(2,3)}.\mathcal{K}^{\alpha}=();\;\mathcal{K}_{1}^{\beta}=(),\ \mathcal{K}_{2}^{\beta}=(1,2);\;\mathcal{K}_{1}^{\gamma}=\{(),(1,2),(3,4),(1,2)(3,4)\},\ \mathcal{K}_{2}^{\gamma}=\{(1,3)(2,4),(1,4)(2,3)\}. (39)

This set defines the group of symmetry of the multilayer network. There are three possible clustered patterns: (1a) layer β\beta and layer γ\gamma fully synchronized, (1b) layer β\beta fully synchronized and layer γ\gamma clustered synchronized (either 1 with 3 and 2 with 4 or, equivalently, 1 with 4 and 2 with 3), and (2) layer β\beta not synchronized and layer γ\gamma synchronized in clusters (1 with 2 and 3 with 4). The stability of each one of these clustered patterns is analyzed in detail in the Supplementary Note 6 and is here summarized in Figure 5. Plot a shows the two MLEs transverse to solution 1a. Solid and dotted lines refer to transverse blocks B2B^{2} and B1bB^{1b}, respectively (blocks defined in the Supplementary Note 6). Pattern 1a is stable when both the curves are negative. b shows MLEs transverse to stable solutions on the synchronized manifold 1b. Blue curves refer to the transverse MLE of solution of kind 1a, while the red curve refers to the transverse MLE of solution of kind 1b. c shows MLEs transverse to stable solutions on the synchronized manifold 2. Blue curves refer to the transverse MLE of solution of kind 1a, while the yellow curves refer to the transverse MLE of solution of kind 2.

The equivalence class subgroup 𝒦1γ\mathcal{K}_{1}^{\gamma} shows the ILS’s for the γ\gamma layer. The symmetry breaking of the (1,2)(3,4)(1,2)(3,4) permutation for the [1,2,3,4][1,2,3,4] cluster causes the cluster to break into two clusters, [1,3],[2,4][1,3],[2,4] or [1,4],[2,3][1,4],[2,3]. Those ILS permutations are what allows layer β\beta to remain synchronized in case (1b) above. Note, however, that breaking of the individual permutations like (1,2) by itself will cause a breaking of one of the 𝒦2γ\mathcal{K}_{2}^{\gamma} permutations, so it is essential to check that the symmetry breakings of 𝒦1γ\mathcal{K}_{1}^{\gamma} are not inducing other symmetry breakings in the same layer, but from other cosets. If they are not, then the other layers are unaffected by the loss of an ILS.

Refer to caption
Figure 5: Stability of different cluster synchronization patterns. a MLEs transverse to solution 1a. Solid and dotted lines refer to different transverse blocks. When a line crosses zero it identifies a symmetry breaking bifurcation in one of the other invariant manifold (red: bifurcations on CS manifold 1b - yellow: bifurcations on CS manifold 2). Pattern 1a is stable when both the curves are negative. b MLEs transverse to stable solutions on the synchronized manifold 1b. Blue curves refer to the transverse MLE of solution of kind 1a, while the red curve refers to the transverse MLE of solution of kind 1b. Vertical lines indicate the bifurcations of the quotient system. c MLEs transverse to stable solutions on the synchronized manifold 2. Blue curves refer to the transverse MLE of solution of kind 1a, while the yellow curves refer to the transverse MLE of solution of kind 2. Vertical lines indicate the bifurcations of the quotient system. Colored lines represent symmetry breaking bifurcation (inferred from a), while black lines are other bifurcations.
Refer to caption
Figure 6: Onset of different cluster synchronization patterns as varying kCk_{C}. We observe five kinds of clustered behavior, which are denoted by the shading of the background. Shading with two-colored striping indicates bistability between the two states represented by each color. a MLE transverse to each identified clustered solution. (Green) Pattern 1a; (Yellow) Pattern 2-(π/2\pi/2); (Lavender) Pattern 2-(π\pi); (Blue) Pattern 1b; and (White) No pattern. b different stable solutions present in each of the structurally different regions (identified by a bifurcation of a stable solution both in one of the quotient networks or transverse to them). (Star) A stable solution of kind 1b occurs when the red line is negative; (Square) a modified version of kind 1b occurs when the red line is positive.

With all three patterns, we can draw Figure 6, where we report the maximum of the two blue curves in Figure 5a (blue), the red curve in Figure 5b (red) and the yellow curves in Figure 5c (yellow). We can thus identify the parameter regions in which the different analyzed behaviors are present. Below we comment on Figure 6 and explain the sequence of bifurcations that occur in the system as the parameter kCk_{C} is decreased (i.e., from right to left looking at the figure.) For large positive coupling, 1a is stable and it is the only attractor of the system. This region is shaded in green in Figure 6. At kC=0.2k_{C}=0.2, we observe the split of the two nodes in layer β\beta (the FHNs, transverse direction toward 2 in the TT matrix). The symmetry breaking (pitchfork) bifurcation is supercritical, and a solution of kind 2 is born. This region is shaded in yellow. At kC=0.14k_{C}=0.14 a second stable clustered solution of type 2 is born through a saddle-node bifurcation (via the quotient network 2 dynamics). This solution is characterized by a phase separation of the two FHN oscillators of π\pi, and a slightly higher oscillations frequency. It remains stable until kCk_{C} is reduced to -0.28. We thus have a region with two solutions of kind 2: the one created at kC=0.2k_{C}=0.2 where the two FHNs are slightly phase shifted (whose MLE can be found looking at the yellow curve from right to left) and the one created at kC=0.14k_{C}=0.14 where the two FHNs are anti-phase (whose MLEs can be found looking at the yellow curve from left to right). We call these two states pattern 2-(π/2\pi/2) and pattern 2-(π\pi), respectively. The state created at kC=0.14k_{C}=0.14 is shaded in lavender; the bistable region is striped lavender and yellow. At kC=0.07k_{C}=0.07, the clustered solution 2-(π/2\pi/2) loses its stability giving rise to an unsychronous solution, shaded in white. This solution disappears through a saddle-node bifurcation at kC=0k_{C}=0. For kC[0.27,0]k_{C}\in[-0.27,0], the system has two possible solutions. The first (shaded lavender) is pattern 2-(π\pi). The second (shaded in blue) has two possible behaviors: when the red curve is negative, it is of kind 1b (see star for example), or when the red curve is positive, it is a slightly non synchronized modification of pattern 1b (see square for example) in which the two FHNs remains locked, while the Colpitts are not perfectly synchronized. This last solution is present because the inductively coupled Colpitts pairs are antiphase; as a result, the FHN (which is coupled to both Colpitts) sees a very small net signal from the two Colpitts. Consequently, the Colpitts can very nearly synchronize even though they receive slightly different inputs. Finally, at kC=0.28k_{C}=-0.28 the pattern 2-(π\pi) solution undergoes a catastrophic symmetry breaking bifurcation, leaving 1b as the only possible attractor of the system (or its slight modification when the red curve is positive.) Experimental data showing qualitative agreement with the numerical results in Figure 6 are included in the Supplemetary Note 7.

Discussion

In this paper we study analytically, numerically, and experimentally the general problem of cluster synchronization (CS) in multilayer networks; these systems are composed of heterogeneous components that may interact in multiple ways. We first present a general set of equations that describes the dynamics of a multilayer network. We then define for the first time the group of symmetries of a multilayer network and explain how to compute it. An analysis of several datasets of real multilayer networks shows they possess large number of symmetries.

We investigate the stability of the CS patterns which correspond to the orbits of the multilayer network. The symmetries of each layer as well as the particular pattern of interlayer connections determine the CS patterns in multilayer networks; we consequently describe how each layer’s symmetry group relates to the symmetry groups of other layers through interlayer connections. The interplay between the intralayer and interlayer couplings enables distinction between symmetries that affect the types of allowed dynamics in the other layers (DLS) and those that do not (ILS.) The latter form a normal subgroup of the full symmetry group. In particular, a symmetry-breaking bifurcation, associated with the ILS subgroup, breaks up a clustered pattern in one layer of the multilayer network without altering the possible clusters in the other layers.

With an IRR change of coordinates we decouple the stability problem into several simpler (lower dimensional) problems. First, we decouple perturbations along directions parallel to the synchronization manifold from those transverse to it; the latter determine stability of the clustered motion. Second, we decouple the equations for the transverse perturbations into several independent blocks; each block corresponds to the stability of either an individual cluster or a set of intertwined clusters [20]. When two or more clusters (which may belong to different layers) are intertwined, they are either all stable or all unstable. We see that Dependent Layer Symmetries yield blocks of a different structure than those arising in the study of single layer networks, which we show has a profound effect on the stability of the clusters involving these symmetries. In particular, we show analytically for a specific class of networks that DLS clusters are more difficult to synchronize than in the case in which the systems in different layers are of the same type, which is also confirmed numerically in simulations involving multilayer networks of Van der Pol, Lorenz, and Roessler oscillators (Supplementary Note 5.)

We performe experiments with a fully analog multilayer network with seven electronic oscillators of three different kinds coupled with two kinds of coupling. The testbed circuit has many features that occur in natural multilayer systems, like noise and parameter mismatches. The experiment is a good test of the theoretical framework because it allow us to understand how theoretical predictions, made with simplifying assumptions, can be a guide to better understand real phenomena. In fact, the experimental results largely match the theoretical predictions; we observe all the predicted cluster states in the right part of the parameter space. With respect to the experimental realization, the model includes several simplifications: we assume all the nodes within the same layer are identical, we assume that all the connections of the same type are identical, we use a simplified FHN model which neglects two resistors, we use ideal models for the operational amplifiers and the transistors, and we assume no noise and neglect any stray inductance, capacitance, or resistance. We discuss why the experimental and theoretical results differ in our seven node electronic system in Supplementary Note 8. A broader, multisystem analysis of the robustness of the method to heterogeneity, noise, and network nonideality would enhance the utility of the method.

A variety of real world systems are multilayer networks that can exhibit clustering. Dynamical situations, to which our analysis may be relevant include: opinion dynamics and consensus among individuals interacting through different communication systems, for which clustering may show up on average, see e.g., [39], the dynamics of central pattern generators, small networks of similar neurons, which might show symmetries and clustering since synchronization is part of their dynamics, see e.g., [10], and electronic networks and in general man-made systems formed of many identical subsystems or nodes, which may produce cluster synchronization. Recent work [51] has studied how network symmetries may affect synchronization modes of power grids and even suggested that symmetries may enhance complete synchronization in multilayer grids, characterized by the presence of different energy sources, such as power generators, wind turbines, solar, etc. Our work describes how clusters may arise in multilayer networks with a given structure; with further study, it may be possible to infer the structure of a multilayer network given the observation of clusters.

A main limitation of our approach is its scalability with the number of nodes of a multilayer network. While the size of the network for which symmetries can be found is very large [52], the size for which the stability analysis can be performed is typically much smaller [23]. We also model the systems in each layer as exactly identical; this is not a characteristic of experimental systems (for a discussion of the discrepancies between our experiment and our simulations see Supplementary Note 8.) A recent paper analyzed cluster synchronization in the presence of nearly identical systems [22], though the approach of [22] is not easily generalizable to the case of multilayer networks. Although our multilayer framework does not allow node heterogeneity and noise, we saw broad agreement between our predictions and experimental circuit behavior; this circuit contained slightly heterogeneous nodes with noise. Within this study, we cannot quantitatively state when noise or heterogeneity will qualitatively impact our predictions, but the experiment demonstrates that there is some tolerance. Further work will be needed to characterize these limitations.

Finally, despite the generality of the theory proposed in this manuscript, several extensions are possible. An important direction for the research is to allow both intra-layer and inter-layer connections to be directed. Another direction is to study the formation of CS patterns that are not related to symmetries in multilayer networks, see e.g. [24]. The case of group consensus which can be seen as a very special case (i.e., with linear dynamics) of the cluster synchronization problem considered here, has recently been studied in [53].

Data availability

All data supporting the findings of this study are available within the article and its supplementary information files and from the corresponding author upon reasonable request.

Methods

Formal Proofs

Theorem 1.

α\mathcal{H}^{\alpha} is a subgroup of 𝒢α\mathcal{G}^{\alpha} and β\mathcal{H}^{\beta} is a subgroup of 𝒢β\mathcal{G}^{\beta}.

Proof.

To prove the theorem we must show that the identity element of 𝒢α\mathcal{G}^{\alpha} is contained in α\mathcal{H}^{\alpha}, and whenever g1g_{1} and g2g_{2} are in α\mathcal{H}^{\alpha}, then so are h11h_{1}^{-1} and h1h2h_{1}h_{2}, so the elements of α\mathcal{H}^{\alpha}indeed form a group. We prove the theorem for α\mathcal{H}^{\alpha}. The proof for β\mathcal{H}^{\beta} is identical.

Identity. Let eαe_{\alpha} be the identity of 𝒢α\mathcal{G}^{\alpha} and eβe_{\beta} be the identity of 𝒢β\mathcal{G}^{\beta}. We see that ealphae_{a}lpha is in HalphaH^{a}lpha, since

eαAαβ=Aαβ=Aαβeβ.e_{\alpha}A^{\alpha\beta}=A^{\alpha\beta}=A^{\alpha\beta}e_{\beta}.

Inverse existence. For all gαg\in\mathcal{H}^{\alpha} exist g1αg^{-1}\in\mathcal{H}^{\alpha}. By definition, if gαg\in\mathcal{H}^{\alpha} then there exists hh such that gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h. Consider the permutation g1g^{-1}, then

gAαβ=Aαβhg1gAαβ=g1AαβhAαβh1h=g1AαβhgA^{\alpha\beta}=A^{\alpha\beta}h\quad\Rightarrow\quad g^{-1}gA^{\alpha\beta}=g^{-1}A^{\alpha\beta}h\quad\Rightarrow\quad A^{\alpha\beta}h^{-1}h=g^{-1}A^{\alpha\beta}h

thus obtaining Aαβ=g1Aαβhg1Aαβ=Aαβh1A^{\alpha\beta}=g^{-1}A^{\alpha\beta}h\Rightarrow g^{-1}A^{\alpha\beta}=A^{\alpha\beta}h^{-1}. Since 𝒢β\mathcal{G}^{\beta} is a group, h𝒢βh1𝒢βh\in\mathcal{G}^{\beta}\Rightarrow h^{-1}\in\mathcal{G}^{\beta}, thus proving that g1αg^{-1}\in\mathcal{H}^{\alpha}.

Closure. We need to prove that if g1g_{1} and g2g_{2} are in α\mathcal{H}^{\alpha}, then the product g1g2g_{1}g_{2} is also in α\mathcal{H}^{\alpha}. By definition, since g1,g2αg_{1},\ g_{2}\in\mathcal{H}^{\alpha}, there exist h1,h2h_{1},\ h_{2} such that g1Aαβ=Aαβh1g_{1}A^{\alpha\beta}=A^{\alpha\beta}h_{1} and g2Aαβ=Aαβh2g_{2}A^{\alpha\beta}=A^{\alpha\beta}h_{2}. Then

g1g2Aαβ=g1Aαβh2=Aαβh1h2.g_{1}g_{2}A^{\alpha\beta}=g_{1}A^{\alpha\beta}h_{2}=A^{\alpha\beta}h_{1}h_{2}.

Since 𝒢β\mathcal{G}^{\beta} is a group, h1,h2𝒢βh1h2𝒢βh_{1},h_{2}\in\mathcal{G}^{\beta}\Rightarrow h_{1}h_{2}\in\mathcal{G}^{\beta}, thus proving that g1g2αg_{1}g_{2}\in\mathcal{H}^{\alpha}. ∎

A consequence of the theorem is that gαg𝒢αg\in\mathcal{H}^{\alpha}\Rightarrow g\in\mathcal{G}^{\alpha}: thus, to find α\mathcal{H}^{\alpha}, we have simply to take all the permutations h𝒢βh\in\mathcal{G}^{\beta} and check which of the permutations in 𝒢α\mathcal{G}^{\alpha} respect the conjugacy relation (11). Similarly, we can define the conjugate set Eq. (13), find its elements in the same way and show that it is a subgroup of 𝒢β\mathcal{G}^{\beta}.

Since we are interested here only in undirected networks, we prove a corollary that simplifies the computations of α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta}.

Corollary 1.

For the case of undirected networks we only need one of the following relationships to prove that α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} are subgroups, (i) gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h or (ii) hAβα=AβαghA^{\beta\alpha}=A^{\beta\alpha}g.

Proof.

Let’s choose to use relationship (i) to define α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta}. This means eliminating requirement (ii) in the α\mathcal{H}^{\alpha} definition and replacing (ii) with (i) in the β\mathcal{H}^{\beta} definition. We can use the same logic we used in the previous theorem to show that these definitions of α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} also produce subgroups. The question is, are they the same as those of Eqs. (12) and (13)? We can show that this is the case using the fact that for undirected coupling the overall coupling matrix is symmetric. Hence, off-diagonal interlayer coupling blocks are related as in Aβα=(Aαβ)TA^{\beta\alpha}=(A^{\alpha\beta})^{T}. For permutations h1=hTh^{-1}=h^{T}, etc. Hence, since α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} are groups, h1h^{-1} and g1g^{-1} also obey the defining equation (i), so

g1Aαβ=Aαβh1gTAαβ=AαβhT(Aαβ)Tg=h(Aαβ)T(Aαβ)Tg=h(Aαβ)ThAβα=Aβαg\begin{split}g^{-1}A^{\alpha\beta}=A^{\alpha\beta}h^{-1}\iff g^{T}A^{\alpha\beta}=A^{\alpha\beta}h^{T}\iff(A^{\alpha\beta})^{T}g=h(A^{\alpha\beta})^{T}\\ \iff(A^{\alpha\beta})^{T}g=h(A^{\alpha\beta})^{T}\iff hA^{\beta\alpha}=A^{\beta\alpha}g\end{split} (40)

A consequence of this corollary is that for the case of undirected networks, if h𝒢βh\in\mathcal{G}^{\beta} is involved in a conjugacy relation for some gg, then it is in β\mathcal{H}^{\beta}. As a result, one does not need to search for both α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta}, but populating α\mathcal{H}^{\alpha} automatically populates β\mathcal{H}^{\beta}.

Theorem 2.

𝒦1α\mathcal{K}^{\alpha}_{1} is a subgroup of α\mathcal{H}^{\alpha}.

Proof.

Identity. The identity eαe_{\alpha} is in 𝒦1α\mathcal{K}^{\alpha}_{1} by definition.

Inverse. Let g𝒦1αg\in\mathcal{K}^{\alpha}_{1} then, eαAαβ=g1gAαβ=Aαβe_{\alpha}A^{\alpha\beta}=g^{-1}gA^{\alpha\beta}=A^{\alpha\beta}. But we also have gAαβ=AαβgA^{\alpha\beta}=A^{\alpha\beta}, hence, g1Aαβ=Aαβg^{-1}A^{\alpha\beta}=A^{\alpha\beta} so g1𝒦1αg^{-1}\in\mathcal{K}^{\alpha}_{1}.

Closure. Let g1 and g2𝒦1αg_{1}\text{ and }g_{2}\in\mathcal{K}^{\alpha}_{1} then, g1g2Aαβ=g1Aαβ=Aαβg1g2𝒦1αg_{1}g_{2}A^{\alpha\beta}=g_{1}A^{\alpha\beta}=A^{\alpha\beta}\implies g_{1}g_{2}\in\mathcal{K}^{\alpha}_{1}.

Hence, 𝒦1α\mathcal{K}^{\alpha}_{1} is a subgroup of α\mathcal{H}^{\alpha}.

The same reasoning holds for the β\beta layer, etc. Next we state an additional property of the subgroups 𝒦1α\mathcal{K}^{\alpha}_{1}, 𝒦1β\mathcal{K}^{\beta}_{1}, etc.:

Corollary 2.

𝒦1α\mathcal{K}^{\alpha}_{1} is a normal subgroup. This means that if g1𝒦1αg_{1}\in\mathcal{K}^{\alpha}_{1}, then gα\forall g\in\mathcal{H}^{\alpha} we have g1g1g𝒦1αg^{-1}g_{1}g\in\mathcal{K}^{\alpha}_{1} or, equivalently, g1𝒦1αg=𝒦1αg^{-1}\mathcal{K}^{\alpha}_{1}g=\mathcal{K}^{\alpha}_{1}.

Proof.

We know gα\forall g\in\mathcal{H}^{\alpha}, if gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h, then g1Aαβ=Aαβh1g^{-1}A^{\alpha\beta}=A^{\alpha\beta}h^{-1}. Hence, g1𝒦1α\forall g_{1}\in\mathcal{K}^{\alpha}_{1}, g1g1gAαβ=g1g1Aαβh=g1Aαβh=Aαβh1h=Aαβg1g1gK1αg^{-1}g_{1}gA^{\alpha\beta}=g^{-1}g_{1}A^{\alpha\beta}h=g^{-1}A^{\alpha\beta}h=A^{\alpha\beta}h^{-1}h=A^{\alpha\beta}\implies g^{-1}g_{1}g\in K^{\alpha}_{1} and K1αK^{\alpha}_{1} is a normal subgroup. ∎

And, finally, we prove the following corollary.

Corollary 3.

All the 𝒦iα\mathcal{K}^{\alpha}_{i}, i1i\neq 1, are left and right cosets of 𝒦1α\mathcal{K}^{\alpha}_{1}.

Proof.

If g1𝒦1αg_{1}\in\mathcal{K}^{\alpha}_{1} and g𝒦iαg\in\mathcal{K}^{\alpha}_{i} with gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h , then gg1Aαβ=gAαβ=Aαβhgg1𝒦iαgg_{1}A^{\alpha\beta}=gA^{\alpha\beta}=A^{\alpha\beta}h\implies gg_{1}\in\mathcal{K}^{\alpha}_{i}. Similarly we can prove g1g𝒦iαg_{1}g\in\mathcal{K}^{\alpha}_{i}. Since group products are unique, i.e. gg1=gg2g1=g2gg_{1}=gg_{2}\implies g_{1}=g_{2}, we have g𝒦1α=𝒦iα=𝒦iαgg\mathcal{K}^{\alpha}_{1}=\mathcal{K}^{\alpha}_{i}=\mathcal{K}^{\alpha}_{i}g. So , 𝒦iα\mathcal{K}^{\alpha}_{i} are left and right cosets of 𝒦1α\mathcal{K}^{\alpha}_{1}. This also means all the 𝒦iα\mathcal{K}^{\alpha}_{i} have the same number of elements. ∎

Properties of the Equivalence Classes and structure of the matrix TT

Using the equivalence classes of each layer we can show the following is true: the TT matrix for the entire multilayer system is of a block diagonal form:

T=(Tα00Tβ)T=\begin{pmatrix}T^{\alpha}&0\\ 0&T^{\beta}\\ \end{pmatrix} (41)

Can we find the matrices of each block independently? This may seem intuitively obvious, but it is not obvious that the arithmetic will work out. Consider the two layer system α\alpha and β\beta as above. The group 𝒢\mathcal{G} of the full system is given by the union of direct products such as 𝒦iα×𝒦iβ\mathcal{K}^{\alpha}_{i}\times\mathcal{K}^{\beta}_{i}. If nαn_{\alpha} is the number of elements in 𝒦iα\mathcal{K}^{\alpha}_{i} and nβn_{\beta} is the number of elements in 𝒦iβ\mathcal{K}^{\beta}_{i}, then the number of elements in an equivalence class direct product is nαnβn_{\alpha}n_{\beta}. And if KK is the number of equivalence classes, then the number of terms in the whole direct product is KnαnβKn_{\alpha}n_{\beta}.

In the calculation of the TT matrix for the entire system we form the projection operators P(l)P^{(l)} for each of the IRR labeled by ll using the sums [20]

P(l)=d(l)d𝒞μ𝒞(l)g𝒞gP^{(l)}=\frac{d^{(l)}}{d}\sum_{\cal C}\mu^{(l)}_{\cal C}\sum_{g\in\cal C}g (42)

where 𝒞\cal C is a conjugacy class, μ𝒞(l)\mu^{(l)}_{\cal C} is the character of that class for the llth IRR, d(l)d^{(l)} is the dimension of the llth IRR and dd is the order (size) of the group. For the multilayer system d=Knαnβd=Kn_{\alpha}n_{\beta}. The elements of the β\beta level group appear in the sum nαn_{\alpha} times and the elements of the α\alpha level group appear in the sum nβn_{\beta} times. This will contribute factors to the sum for each layer. However, because d=Knαnβd=Kn_{\alpha}n_{\beta} is in the denominator the extra factors in the numerator will be cancelled in each layer leaving the correct dimension divisor for each layer’s sum. Hence, we can find the TT matrix for the whole system by finding the TT matrices (TαT^{\alpha} and TβT^{\beta}) for each layer independently and putting them into the block form to construct TT.

Computing the symmetry group of a simple multilayer network

Let us consider the simple example of a two-layer undirected network shown in Fig. 1. We show in detail the calculations to determine the final group 𝒢\mathcal{G} of the full network.

The group of symmetries of the two layers are (written in cyclic notation)

𝒢α\displaystyle\mathcal{G}^{\alpha} =\displaystyle= {(),(1,2)(3,4),(2,4),(1,4,3,2),(1,2,3,4),(1,3),(1,4)(2,3),(1,3)(2,4)},\displaystyle\{(),(1,2)(3,4),(2,4),(1,4,3,2),(1,2,3,4),(1,3),(1,4)(2,3),(1,3)(2,4)\}, (43)
𝒢β\displaystyle\mathcal{G}^{\beta} =\displaystyle= {(),(1,3)},\displaystyle\{(),(1,3)\}, (44)

where, for example, (1,4)(2,3) means move node 1 to node 4 (and 4 to 1) and 3 to 2 (and 2 to 3). Also, (1,4,3,2) means move 1 to 4, 4 to 3, 3 to 2, and 2 to 1.

From these we determine α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta} using the results of Theorem 1. To find α\mathcal{H}^{\alpha}, we take all the permutations h𝒢βh\in\mathcal{G}^{\beta} and we check which of the permutations in 𝒢α\mathcal{G}^{\alpha} respect the conjugacy relation (11). We obtain

α\displaystyle\mathcal{H}^{\alpha} =\displaystyle= {(),(1,2)(3,4),(1,4)(2,3),(1,3)(2,4)},\displaystyle\{(),(1,2)(3,4),(1,4)(2,3),(1,3)(2,4)\}, (45)
β\displaystyle\mathcal{H}^{\beta} =\displaystyle= {(),(1,3)},\displaystyle\{(),(1,3)\}, (46)

Now we must define the \sim relation. Applying the permutations in α\mathcal{H}^{\alpha} to AαβA^{\alpha\beta} we obtain

()[100100001001000]=(1,2)(3,4)[100100001001000]=[100100001001000]()(1,2)(3,4)𝒦1α={(),(1,2)(3,4)}()\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}=(1,2)(3,4)\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}=\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}\quad\Longrightarrow\quad\begin{array}[]{c}()\sim(1,2)(3,4)\\[5.69054pt] \mathcal{K}_{1}^{\alpha}=\{(),(1,2)(3,4)\}\end{array}
(1,4)(2,3)[100100001001000]=(1,3)(2,4)[100100001001000]=[001001100100000](1,4)(2,3)(1,3)(2,4)𝒦2α={(1,4)(2,3),(1,3)(2,4)}\qquad(1,4)(2,3)\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}=(1,3)(2,4)\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}=\begin{bmatrix}0&0&1\\ 0&0&1\\ 1&0&0\\ 1&0&0\\ 0&0&0\end{bmatrix}\quad\Longrightarrow\quad\begin{array}[]{c}(1,4)(2,3)\sim(1,3)(2,4)\\[5.69054pt] \mathcal{K}_{2}^{\alpha}=\{(1,4)(2,3),(1,3)(2,4)\}\end{array}

while applying the permutation of β\mathcal{H}^{\beta} to AαβA^{\alpha\beta} and recalling the conjugacy relation gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h we obtain

[100100001001000]()=[100100001001000]𝒦1β={()}\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}()=\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}\quad\Longrightarrow\quad\mathcal{K}_{1}^{\beta}=\{()\}
[100100001001000](1,3)=[001001100100000]𝒦2β={(1,3)}.\begin{bmatrix}1&0&0\\ 1&0&0\\ 0&0&1\\ 0&0&1\\ 0&0&0\end{bmatrix}(1,3)=\begin{bmatrix}0&0&1\\ 0&0&1\\ 1&0&0\\ 1&0&0\\ 0&0&0\end{bmatrix}\quad\Longrightarrow\quad\mathcal{K}_{2}^{\beta}=\{(1,3)\}.

Combining the permutations from each pair of disjoint subsets as in Eq. (8), we obtain the full group,

𝒢={(()00()),((1,2)(3,4)00()),((1,4)(3,2)00(1,3)),((1,3)(2,4)00(1,3))}.\mathcal{G}=\biggl{\{}\begin{pmatrix}()&0\\ 0&()\end{pmatrix},\begin{pmatrix}(1,2)(3,4)&0\\ 0&()\end{pmatrix},\begin{pmatrix}(1,4)(3,2)&0\\ 0&(1,3)\end{pmatrix},\begin{pmatrix}(1,3)(2,4)&0\\ 0&(1,3)\end{pmatrix}\biggr{\}}. (47)

Since 𝒦1α\mathcal{K}_{1}^{\alpha} and 𝒦1β\mathcal{K}_{1}^{\beta} are the subgroups of α\mathcal{H}^{\alpha} and β\mathcal{H}^{\beta}, respectively, this means that the separate clusters in the α\alpha layer, [1,2][1,2] and [3,4][3,4], are ILS clusters and the following cluster bifurcations cause no bifurcations in the possible β\beta dynamics or synchronous clusters (again, stability is a separate issue):

[1,2,3,4][1,3] and [2,4],[1,2,3,4]\rightarrow[1,3]\text{ and }[2,4], (48)

or

[1,2,3,4][1,4] and [2,3],[1,2,3,4]\rightarrow[1,4]\text{ and }[2,3], (49)

which would still allow [1,3] to be synchronous in the β\beta layer. However, the bifurcation

[1,2][3,4][1],[2],[3], and [4][1,2][3,4]\rightarrow[1],[2],[3],\text{ and }[4] (50)

would break a symmetry in the coset 𝒦2α\mathcal{K}_{2}^{\alpha} if the nodes 11 and 33 were synchronized. But if they are not synchronized, then the system is operating in a subgroup of the original group and only the identity would remain for the β\beta layer. This means in this case 11 and 33 are each in their own (trivial) cluster already in the β\beta layer and that does not prevent either state [1,2][3,4][1,2][3,4] or [1],[2],[3],[4][1],[2],[3],[4] in the α\alpha layer. These cases can be easily seen from Fig. 1 since node 11 in the β\beta layer only depends on the sum of nodes 11 and 22 in the α\alpha layer. And similarly for the dependence of node 33 in the β\beta layer on nodes 33 and 44 in the α\alpha layer. However, while these ILS relations are easy to see in this simple case, it would require the calculation of 𝒦1α\mathcal{K}_{1}^{\alpha} and 𝒦1β\mathcal{K}_{1}^{\beta} for more complicated networks to find the ILS’s, associated clusters, and their allowed bifurcations.

Symmetries of multiplex and multidimensional networks

Here we describe how to compute the group of symmetries of multiplex and multidimensional networks, which are special cases of the general multilayer network problem presented in the Results Section. We show that the problems of computing the group of symmetries of a multiplex network and of a multidimensional network are closely related to each other. In what follows, we start by considering the problem of computing the symmetry group of a multiplex network and mapping it to the problem of computing the symmetry group of a multidimensional network.

Multiplex networks [32, 33, 34] are a particular class of multilayer networks; in multiplex networks, different features of the same set of agents are described in each different layer (e.g., in a social system, each layer represents the opinion of a person on a different topic, and links capture how the different social interactions influence the person thinking on each topic). A multiplex network is thus formed of several layers, with each layer containing the same number of nodes 𝒩\mathcal{N}. Moreover, since interlayer coupling only occurs between node ii in a given layer and the same node ii in a different layer, Aαβ=𝕀𝒩A^{\alpha\beta}=\mathbb{I}_{\mathcal{N}}, where 𝕀𝒩\mathbb{I}_{\mathcal{N}} is the 𝒩\mathcal{N}-dimensional identity matrix.

A general multiplex network is governed by the following set of equations [37, 54],

𝐱˙iα=𝐅α(𝐱iα)+σααj=1𝒩Aijαα𝐇αα(𝐱jα)+βασαβ𝐇αβ(𝐱iβ),\dot{\bf x}_{i}^{\alpha}={\bf F}^{\alpha}({\bf x}_{i}^{\alpha})+\sigma^{\alpha\alpha}\sum_{j=1}^{\mathcal{N}}A_{ij}^{\alpha\alpha}{\bf H}^{\alpha\alpha}({\bf x}_{j}^{\alpha})+\sum_{\beta\neq\alpha}\sigma^{\alpha\beta}{\bf H}^{\alpha\beta}({\bf x}_{i}^{\beta}), (51)

i=1,,𝒩i=1,...,\mathcal{N}, where the matrix AααA^{\alpha\alpha} represents the intra-layer connectivity, the function 𝐅α{\bf F}^{\alpha} represents the intrinsic dynamics of each node inside a layer and the functions 𝐇αα{\bf H}^{\alpha\alpha} and 𝐇αβ{\bf H}^{\alpha\beta} represent the form of the intra- and inter-layer coupling, respectively.

We reduce the set of Eqs. (51) to a much more compact form and use it to compute the symmetries of a multiplex network. Introducing

𝐱i=[𝐱iα𝐱iβ],𝐅(𝐱i)=[𝐅α(𝐱iα)+λασαλ𝐇αλ(𝐱iλ)𝐅β(𝐱iβ)+λβσβλ𝐇βλ(𝐱iλ)],𝐇λ(𝐱i)=[δλα𝐇αα(𝐱iα)δλβ𝐇ββ(𝐱iβ)],σλ=σλλAλ=Aλλ{\bf x}_{i}=\begin{bmatrix}{\bf x}_{i}^{\alpha}\\ {\bf x}_{i}^{\beta}\\ \vdots\end{bmatrix},\quad{\bf F}({\bf x}_{i})=\begin{bmatrix}{\bf F}^{\alpha}({\bf x}_{i}^{\alpha})+\sum_{\lambda\neq\alpha}\sigma^{\alpha\lambda}{\bf H}^{\alpha\lambda}({\bf x}_{i}^{\lambda})\\ {\bf F}^{\beta}({\bf x}_{i}^{\beta})+\sum_{\lambda\neq\beta}\sigma^{\beta\lambda}{\bf H}^{\beta\lambda}({\bf x}_{i}^{\lambda})\\ \vdots\end{bmatrix},\quad{\bf H}^{\lambda}({\bf x}_{i})=\begin{bmatrix}\delta_{\lambda\alpha}{\bf H}^{\alpha\alpha}({\bf x}_{i}^{\alpha})\\ \delta_{\lambda\beta}{\bf H}^{\beta\beta}({\bf x}_{i}^{\beta})\\ \vdots\\ \end{bmatrix},\quad\begin{array}[]{c}\sigma^{\lambda}=\sigma^{\lambda\lambda}\\ A^{\lambda}=A^{\lambda\lambda}\end{array} (52)

where λ{α,β,}\lambda\in\{\alpha,\beta,\ldots\}, δαλ\delta_{\alpha\lambda} is the Kronecker delta (e.g., δλα=1\delta_{\lambda\alpha}=1 if λ=α\lambda=\alpha, 0 otherwise) we can rewrite Eq. (51) as

𝐱˙=𝐅(𝐱)+λ=1ΛσλAλ𝐇λ(𝐱),\dot{\bf x}={\bf F}({\bf x})+\sum_{\lambda=1}^{\Lambda}\sigma^{\lambda}A^{\lambda}{\bf H}^{\lambda}({\bf x}), (53)

which is the equation of a multidimensional network [35, 36], i.e., a network with only one layer but different types of interactions. Each interaction type is described by a different adjacency matrix AλA^{\lambda}, λ=1,,Λ\lambda=1,...,\Lambda. Blaha et al. [31] recently presented a simple experimental realization of such a network.

We have shown the equivalence between a multiplex network and a multidimensional network. We now discuss how to compute the symmetries of the multidimensional network (53), both analytically and computationally. The analytic approach gives insight into the origins of the final symmetry permutation group. The software approach allows a direct calculation of the full group, but without the insights into its structure.

To analytically define the group of symmetries of the multidimensional network, we introduce 𝒢λ\mathcal{G}^{\lambda} as the group of symmetries for each interaction type λ\lambda. Each element of the group 𝒢λ\mathcal{G}^{\lambda} can be represented by a permutation matrix Π\Pi that commutes with AλA^{\lambda}, ΠAλ=AλΠ\Pi A^{\lambda}=A^{\lambda}\Pi. Then, the symmetry group of the whole multidimensional network 𝒢\mathcal{G} is given by 𝒢1𝒢2𝒢Λ\mathcal{G}^{1}\cap\mathcal{G}^{2}...\cap\mathcal{G}^{\Lambda}, which is the largest common subgroup of the Λ\Lambda symmetry groups {𝒢λ}\{\mathcal{G}^{\lambda}\}.

Computationally, the group of symmetries of the multidimensional network 𝒢\mathcal{G} can be found using available computational group theory tools, like GAP or SAGE [55, 56]. This software computes the group of symmetries of a labeled graph [57, 58]; a multidimensional network can easily be remapped to a labeled graph. To remap the network, we define the labeled adjacency matrix AlabA^{\text{lab}}. Matrix entries AijlabA_{ij}^{\text{lab}} are defined by how pairs of nodes ii and jj interact. For each pair of nodes, one of three cases occurs: (i) there is no interaction between ii and jj, (ii) there is one type of weighted interaction between ii and jj and (iii) there are two or more types of weighted interactions between ii and jj. If there is no interaction between node ii and node jj (case i), then Aijlab=0A_{ij}^{\text{lab}}=0. We represent a single edge (case ii) with a 22-tuple (τ,w)(\tau,w), where the integer τ\tau is the edge type and the real number ww is the edge weight. We represent a multiple edge formed by qq interactions (case iii) with a 2q2q-tuple, (τ1,w1,τ2,w2,,,τq,wq)(\tau_{1},w_{1},\tau_{2},w_{2},,...,\tau_{q},w_{q}), τ1<τ2<<τq\tau_{1}<\tau_{2}<...<\tau_{q}, where each pair (τi,wi)(\tau_{i},w_{i}) represents an interaction type and the associated weight. We can partition the set of the network edges into ZZ subsets of edges that are all represented by the same tuple. Then the entries of the matrix AlabA^{\text{lab}} are such that Aijlab=0A^{\text{lab}}_{ij}=0 if there is no interaction between nodes ii and jj and Aijlab=zA^{\text{lab}}_{ij}=z, z=1,,Zz=1,...,Z if the edge between nodes ii and jj belongs to the subset zz. This forces the software to consider only permutations that involve edges of the same type and of the same weight, i.e., permutation matrices Π\Pi that commute with AlabA^{\text{lab}}, ΠAlab=AlabΠ\Pi A^{\text{lab}}=A^{\text{lab}}\Pi. As a result, the computed permutations Π\Pi that form 𝒢λ\mathcal{G}^{\lambda} also commute with all the adjacency matrices of the multidimensional network A1,,AΛA^{1},\ldots,A^{\Lambda}: 𝒢\mathcal{G} is thus the largest common subgroup of the Λ\Lambda symmetry groups.

A network with three layers

In the Results Section we have considered multilayer networks with not more than two layers and only one type of inter-layer coupling. Here we show how our procedure can be generalized to a multilayer netwotk with M=3M=3 layers. Later we will consider the case of any number MM of layers. For the case M=3M=3, the vector field is

𝒙˙α=𝐅α(𝒙α)+σααAαα𝐇αα(𝒙α)+σαβAαβ𝐇αβ(𝒙β)+σαγAαγ𝐇αγ(𝒙γ)𝒙˙β=𝐅β(𝒙β)+σββAββ𝐇ββ(𝒙β)+σβαAβα𝐇βα(𝒙α)+σβγAβγ𝐇βγ(𝒙γ)𝒙˙γ=𝐅γ(𝒙γ)+σγγAγγ𝐇γγ(𝒙γ)+σγαAγα𝐇γα(𝒙α)+σγβAγβ𝐇γβ(𝒙β)\begin{array}[]{rl}\dot{\boldsymbol{x}}^{\alpha}&={\bf F}^{\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\alpha\beta}A^{\alpha\beta}{\bf H}^{\alpha\beta}(\boldsymbol{x}^{\beta})+\sigma^{\alpha\gamma}A^{\alpha\gamma}{\bf H}^{\alpha\gamma}(\boldsymbol{x}^{\gamma})\\ \dot{\boldsymbol{x}}^{\beta}&={\bf F}^{\beta}(\boldsymbol{x}^{\beta})+\sigma^{\beta\beta}A^{\beta\beta}{\bf H}^{\beta\beta}(\boldsymbol{x}^{\beta})+\sigma^{\beta\alpha}A^{\beta\alpha}{\bf H}^{\beta\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\beta\gamma}A^{\beta\gamma}{\bf H}^{\beta\gamma}(\boldsymbol{x}^{\gamma})\\ \dot{\boldsymbol{x}}^{\gamma}&={\bf F}^{\gamma}(\boldsymbol{x}^{\gamma})+\sigma^{\gamma\gamma}A^{\gamma\gamma}{\bf H}^{\gamma\gamma}(\boldsymbol{x}^{\gamma})+\sigma^{\gamma\alpha}A^{\gamma\alpha}{\bf H}^{\gamma\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\gamma\beta}A^{\gamma\beta}{\bf H}^{\gamma\beta}(\boldsymbol{x}^{\beta})\end{array} (54)

If we apply three permutations g𝒢αg\in\mathcal{G}^{\alpha}, h𝒢βh\in\mathcal{G}^{\beta}, and k𝒢γk\in\mathcal{G}^{\gamma} on the system we obtain

g𝒙˙α=𝐅α(g𝒙α)+σααAαα𝐇αα(g𝒙α)+σαβgAαβ𝐇αβ(𝒙β)+σαγgAαγ𝐇αγ(𝒙γ)h𝒙˙β=𝐅β(h𝒙β)+σββAββ𝐇ββ(h𝒙β)+σβαhAβα𝐇βα(𝒙α)+σβγhAβγ𝐇βγ(𝒙γ)k𝒙˙γ=𝐅γ(k𝒙γ)+σγγAγγ𝐇γγ(k𝒙γ)+σγαkAγα𝐇γα(𝒙α)+σγβkAγβ𝐇γβ(𝒙β).\begin{array}[]{rl}g\dot{\boldsymbol{x}}^{\alpha}&={\bf F}^{\alpha}(g\boldsymbol{x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}(g\boldsymbol{x}^{\alpha})+\sigma^{\alpha\beta}gA^{\alpha\beta}{\bf H}^{\alpha\beta}(\boldsymbol{x}^{\beta})+\sigma^{\alpha\gamma}gA^{\alpha\gamma}{\bf H}^{\alpha\gamma}(\boldsymbol{x}^{\gamma})\\ h\dot{\boldsymbol{x}}^{\beta}&={\bf F}^{\beta}(h\boldsymbol{x}^{\beta})+\sigma^{\beta\beta}A^{\beta\beta}{\bf H}^{\beta\beta}(h\boldsymbol{x}^{\beta})+\sigma^{\beta\alpha}hA^{\beta\alpha}{\bf H}^{\beta\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\beta\gamma}hA^{\beta\gamma}{\bf H}^{\beta\gamma}(\boldsymbol{x}^{\gamma})\\ k\dot{\boldsymbol{x}}^{\gamma}&={\bf F}^{\gamma}(k\boldsymbol{x}^{\gamma})+\sigma^{\gamma\gamma}A^{\gamma\gamma}{\bf H}^{\gamma\gamma}(k\boldsymbol{x}^{\gamma})+\sigma^{\gamma\alpha}kA^{\gamma\alpha}{\bf H}^{\gamma\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\gamma\beta}kA^{\gamma\beta}{\bf H}^{\gamma\beta}(\boldsymbol{x}^{\beta}).\end{array} (55)

For a directed graph, we have 6 conjugacy relationships to be satisfied:

gAαβ=Aαβh,gAαγ=Aαγk,hAβα=Aβαg,hAβγ=Aβγk,kAγα=Aγαg, and kAγβ=Aγβh.gA^{\alpha\beta}=A^{\alpha\beta}h,\ gA^{\alpha\gamma}=A^{\alpha\gamma}k,\ hA^{\beta\alpha}=A^{\beta\alpha}g,\ hA^{\beta\gamma}=A^{\beta\gamma}k,\ kA^{\gamma\alpha}=A^{\gamma\alpha}g,\text{ and }kA^{\gamma\beta}=A^{\gamma\beta}h.

If the graph is undirected, then half are redundant (e.g., gAαβ=AαβhgA^{\alpha\beta}=A^{\alpha\beta}h is the same relationship as hAβα=AβαghA^{\beta\alpha}=A^{\beta\alpha}g). From these relationships we can define

α={g𝒢α|h𝒢β and k𝒢γ:gAαβ=Aαβh and gAαγ=Aαγk},β={h𝒢β|g𝒢α and k𝒢γ:hAβα=Aβαg and hAβγ=Aβγk},γ={k𝒢γ|g𝒢α and h𝒢β:kAγα=Aγαg and kAγβ=Aγβh}.\begin{array}[]{rcl}\mathcal{H}^{\alpha}&=\left\{g\in\mathcal{G}^{\alpha}|\exists h\in\mathcal{G}^{\beta}\mbox{ and }k\in\mathcal{G}^{\gamma}:gA^{\alpha\beta}=A^{\alpha\beta}h\mbox{ and }gA^{\alpha\gamma}=A^{\alpha\gamma}k\right\},\\ \mathcal{H}^{\beta}&=\left\{h\in\mathcal{G}^{\beta}|\exists g\in\mathcal{G}^{\alpha}\mbox{ and }k\in\mathcal{G}^{\gamma}:hA^{\beta\alpha}=A^{\beta\alpha}g\mbox{ and }hA^{\beta\gamma}=A^{\beta\gamma}k\right\},\\ \mathcal{H}^{\gamma}&=\left\{k\in\mathcal{G}^{\gamma}|\exists g\in\mathcal{G}^{\alpha}\mbox{ and }h\in\mathcal{G}^{\beta}:kA^{\gamma\alpha}=A^{\gamma\alpha}g\mbox{ and }kA^{\gamma\beta}=A^{\gamma\beta}h\right\}.\end{array} (56)

Using the same reasoning as in Theorem 1, each subset in Eqs. (56) is a subgroup of its layer’s group. The equivalence relationship \sim is now defined by a set of two equations that must be satisfied, i.e.,

g1g2g1Aαβ=g2Aαβ and g1Aαγ=g2Aαγg_{1}\sim g_{2}\quad\Longleftrightarrow\quad g_{1}A^{\alpha\beta}=g_{2}A^{\alpha\beta}\mbox{ and }g_{1}A^{\alpha\gamma}=g_{2}A^{\alpha\gamma}

thus defining

𝒦ijα={gα:gAαβ=Mi,gAαγ=Mj},𝒦ijβ={hβ:hAβα=Mi,hAβγ=Mj},𝒦ijγ={kγ:kAγα=Mi,kAγβ=Mj}.\begin{array}[]{lcr}\mathcal{K}^{\alpha}_{ij}&=&\{g\in\mathcal{H}^{\alpha}:gA^{\alpha\beta}=M_{i},\ gA^{\alpha\gamma}=M_{j}\},\\ \mathcal{K}^{\beta}_{ij}&=&\{h\in\mathcal{H}^{\beta}:hA^{\beta\alpha}=M_{i},\ hA^{\beta\gamma}=M_{j}\},\\ \mathcal{K}^{\gamma}_{ij}&=&\{k\in\mathcal{H}^{\gamma}:kA^{\gamma\alpha}=M_{i},\ kA^{\gamma\beta}=M_{j}\}.\end{array} (57)

There are K1K2K_{1}K_{2} disjoint sets for each subgroup \mathcal{H}, where K1K_{1} is the number of different MiM_{i} and K2K_{2} is the number of different MjM_{j} that can be obtained applying any of the compatible permutations. Finally, we form the final symmetry group of the multilayer network using the disjoint sets as in Eq. (15), namely,

𝒢={(g000h000k)|g𝒦ijα , h𝒦ijβ, and k𝒦ijγ for i=1,,K1,j=1,,K2}.\mathcal{G}=\left\{\begin{pmatrix}g&0&0\\ 0&h&0\\ 0&0&k\end{pmatrix}\Big{|}g\in\mathcal{K}^{\alpha}_{ij}\mbox{ , }h\in\mathcal{K}^{\beta}_{ij},\mbox{ and }k\in\mathcal{K}^{\gamma}_{ij}\mbox{ for }i=1,...,K_{1},j=1,...,K_{2}\right\}. (58)

As before with two layers the ILSs for this three-layer case will be in each of the layers’ equivalence class subgroups, 𝒦ijα\mathcal{K}^{\alpha}_{ij}, 𝒦ijβ\mathcal{K}^{\beta}_{ij}, and 𝒦ijγ\mathcal{K}^{\gamma}_{ij}.

Two interlayer coupling types

For the case of two or more coupling types between two layers, the extension is similar to the previous section. The general equation in this case is

𝒙˙α=𝐅α(𝒙α)+σααAαα𝐇αα(𝒙α)+σαβ,1Aαβ,1𝐇αβ,1(𝒙β)+σαβ,2Aαβ,2𝐇αβ,2(𝒙β)𝒙˙β=𝐅β(𝒙β)+σββAββ𝐇ββ(𝒙β)+σβα,1Aβα,1𝐇βα,1(𝒙α)+σβα,2Aβα,2𝐇βα,2(𝒙α).\begin{array}[]{lcr}\dot{\boldsymbol{x}}^{\alpha}&=&{\bf F}^{\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\alpha\alpha}A^{\alpha\alpha}{\bf H}^{\alpha\alpha}(\boldsymbol{x}^{\alpha})+\sigma^{\alpha\beta,1}A^{\alpha\beta,1}{\bf H}^{\alpha\beta,1}(\boldsymbol{x}^{\beta})+\sigma^{\alpha\beta,2}A^{\alpha\beta,2}{\bf H}^{\alpha\beta,2}(\boldsymbol{x}^{\beta})\\ \dot{\boldsymbol{x}}^{\beta}&=&{\bf F}^{\beta}(\boldsymbol{x}^{\beta})+\sigma^{\beta\beta}A^{\beta\beta}{\bf H}^{\beta\beta}(\boldsymbol{x}^{\beta})+\sigma^{\beta\alpha,1}A^{\beta\alpha,1}{\bf H}^{\beta\alpha,1}(\boldsymbol{x}^{\alpha})+\sigma^{\beta\alpha,2}A^{\beta\alpha,2}{\bf H}^{\beta\alpha,2}(\boldsymbol{x}^{\alpha}).\end{array} (59)

Applying two permutations g𝒢αg\in\mathcal{G}^{\alpha} and h𝒢βh\in\mathcal{G}^{\beta} to the system, we obtain 4 conjugacy relationships to be satisfied:

gAαβ,1=Aαβ,1h,gAαβ,2=Aαβ,2h,hAβα,1=Aβα,1g,hAβα,2=Aβα,2g,gA^{\alpha\beta,1}=A^{\alpha\beta,1}h,\quad gA^{\alpha\beta,2}=A^{\alpha\beta,2}h,\quad hA^{\beta\alpha,1}=A^{\beta\alpha,1}g,\quad hA^{\beta\alpha,2}=A^{\beta\alpha,2}g,

, two of which are redundant for undirected graphs. The \mathcal{H} groups are still defined by two of these relationships

α={g𝒢α|h𝒢β:gAαβ,1=Aαβ,1h and gAαβ,2=Aαβ,2h},β={h𝒢β|g𝒢α:hAβα,1=Aβα,1g and hAβα,2=Aβα,2g},\begin{array}[]{rcl}\mathcal{H}^{\alpha}&=&\left\{g\in\mathcal{G}^{\alpha}|\exists h\in\mathcal{G}^{\beta}:gA^{\alpha\beta,1}=A^{\alpha\beta,1}h\mbox{ and }gA^{\alpha\beta,2}=A^{\alpha\beta,2}h\right\},\\ \mathcal{H}^{\beta}&=&\left\{h\in\mathcal{G}^{\beta}|\exists g\in\mathcal{G}^{\alpha}:hA^{\beta\alpha,1}=A^{\beta\alpha,1}g\mbox{ and }hA^{\beta\alpha,2}=A^{\beta\alpha,2}g\right\},\end{array} (60)

and g1g2g_{1}\sim g_{2} only when both produce the same left-hand-side for all conjugacy relationships. The disjoint 𝒦\mathcal{K} sets for each subgroup are generated as before (with two indices, since there are two constraints that define the \sim relationship) and the final symmetry group of the multilayer network using the disjoint sets is as in Eq. (15). The ILSs are found as above.

Any number of layers and inter-layer couplings

Here we present the general case of any number of layers and any number of inter-layer couplings. Extrapolating from our discussion above, we can define the group of symmetries of a multilayer network with any number of layers and types of coupling. The number of conjugacy relationships to satisfy grows as the number of unique types of inter-layer coupling grows; stated plainly, if we have 𝒜\mathcal{A} inter-layer adjacency matrices, we have 𝒜\mathcal{A} conjugacy relationships. In the case of three layers discussed earlier, there are six such inter-layer couplings; in the case of two layers and two types of interlayer couplings, there are four. The conjugacy relationships must then be divided in the various layers to define the \mathcal{H} groups, and two permutations in each of the \mathcal{H} groups have the equivalence relationship \sim when they both give the same result in all the left hand side of the \mathcal{H} defining conjugacy relations. Consequently, the computational effort grows with the number of inter-layer couplings as O(𝒜)O(\mathcal{A}).

Computation of the symmetry group

We have already discussed the computation of the symmetry group for the case of multiplex networks and multidimensional networks. Here we briefly review the computation of the symmetry group for the case of general multilayer networks. In the presence of both nodes of different types and edges of different types, a symmetry is only allowed: (i) when the edges are interchangeable as discussed before for the case of multidimensional networks and (ii) when the nodes that are exchanged are of the same type. Available computational group theory software [55, 56] allows us to handle both aspects, since they also manage multi-partite labeled graph [57, 58].

To satisfy requirement (i), we provide the software with a labeled supra-adjacency matrix AlabA^{\text{lab}} for the multilayer network, which we define in a similar way as for the previously discussed case of the multidimensional network. First, we sequentially renumber all the nodes starting from layer α\alpha (so nodes 1,,Nα1,\ldots,N^{\alpha} are the nodes in layer α\alpha, nodes Nα+1,,Nα+NβN^{\alpha}+1,\ldots,N^{\alpha}+N^{\beta} are the nodes in layer β\beta, and so on). Then we write the matrix AlabA^{\text{lab}} that describes the connections between the nodes of the multilayer network: Aijlab=0A^{\text{lab}}_{ij}=0 if there is no (intralayer or interlayer) connections between ii and jj. If they are connected, AijlabA^{\text{lab}}_{ij} is a tuple as described earlier.

To satisfy requirement (ii), we restrict the search of symmetries to permutations that only involve nodes of the same type (from the same layer). We thus provide the partition 𝒫={{1,,Nα},{Nα+1,,Nα+Nβ},}\mathcal{P}=\big{\{}\{1,\ldots,N^{\alpha}\},\{N^{\alpha}+1,\ldots,N^{\alpha}+N^{\beta}\},\ldots\big{\}} that describes how the renumbered nodes are split between the respective layers. This forces the software to consider only permutations that involve nodes of the same type (within the same subset of the partition.)

Finding the group of symmetries of the multilayer network thus reduces to finding the group of symmetries of the network described by the labeled supra-adjacency matrix AlabA^{\text{lab}}, ΠAlab=AlabΠ\Pi A^{\text{lab}}=A^{\text{lab}}\Pi, with a predefined partition 𝒫\mathcal{P} of the nodes that are allowed to swap with one another.

Mathematical model of the experimental system

Applying Kirchhoff’s laws on the circuit, we can write down the following set of differential equations that govern the system’s dynamics (we color the coupling terms as in Figure 4):

Jumper equations:
(LJ1+LJ2)I˙J\displaystyle\left(L_{J1}+L_{J2}\right)\dot{I}_{J} =\displaystyle= vJ0VJIJRJkFJLF1,J1I˙F,1kFJLF2,J2I˙F,2\displaystyle v_{J}^{0}-V_{J}-I_{J}R_{J}{\color[rgb]{1,.5,0}-k_{FJ}L_{F1,J1}\dot{I}_{F,1}-k_{FJ}L_{F2,J2}\dot{I}_{F,2}}
CJV˙J\displaystyle C_{J}\dot{V}_{J} =\displaystyle= IJ\displaystyle I_{J}
FHN 1:
LF,1I˙F,1\displaystyle L_{F,1}\dot{I}_{F,1} =\displaystyle= VF,1R3,1IF,1kFJLF1,J1I˙J\displaystyle V_{F,1}-R_{3,1}I_{F,1}{\color[rgb]{1,.5,0}-k_{FJ}L_{F1,J1}\dot{I}_{J}}
CF,1V˙F,1\displaystyle C_{F,1}\dot{V}_{F,1} =\displaystyle= f[VF,1]IF,1+1RC[(Vce,1Vbe,1VF,1)+(Vce,2Vbe,2VF,1)]\displaystyle-f\left[V_{F,1}\right]-I_{F,1}{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left[\left(V_{ce,1}-V_{be,1}-V_{F,1}\right)+\left(V_{ce,2}-V_{be,2}-V_{F,1}\right)\right]}
FHN 2:
LF,2I˙F,2\displaystyle L_{F,2}\dot{I}_{F,2} =\displaystyle= VF,2R3,2IF,2kFJLF2,J2I˙J\displaystyle V_{F,2}-R_{3,2}I_{F,2}{\color[rgb]{1,.5,0}-k_{FJ}L_{F2,J2}\dot{I}_{J}}
CF,2V˙F,2\displaystyle C_{F,2}\dot{V}_{F,2} =\displaystyle= f[VF,2]IF,2+1RC[(Vce,3Vbe,3VF,2)+(Vce,4Vbe,4VF,2)]\displaystyle-f\left[V_{F,2}\right]-I_{F,2}{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left[\left(V_{ce,3}-V_{be,3}-V_{F,2}\right)+\left(V_{ce,4}-V_{be,4}-V_{F,2}\right)\right]}
Colpitts 1:
Cce,1V˙ce,1\displaystyle C_{ce,1}\dot{V}_{ce,1} =\displaystyle= IL,1Ic[Vbe,1]+1RC(VF,1(Vce,1Vbe,1))\displaystyle I_{L,1}-I_{c}\left[V_{be,1}\right]{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left(V_{F,1}-\left(V_{ce,1}-V_{be,1}\right)\right)}
Cbe,1V˙be,1\displaystyle C_{be,1}\dot{V}_{be,1} =\displaystyle= (Vee+Vbe,1)Ree,1Ib[Vbe,1]IL,11RC[VF,1(Vce,1Vbe,1)]\displaystyle-\frac{\left(V_{ee}+V_{be,1}\right)}{R_{ee,1}}-I_{b}\left[V_{be,1}\right]-I_{L,1}{\color[rgb]{0,0,1}-\frac{1}{R_{C}}\left[V_{F,1}-\left(V_{ce,1}-V_{be,1}\right)\right]}
LCI˙L,1\displaystyle L_{C}\dot{I}_{L,1} =\displaystyle= VccVce,1+Vbe,1RL,1IL,1kCLCI˙L,2\displaystyle V_{cc}-V_{ce,1}+V_{be,1}-R_{L,1}I_{L,1}{\color[rgb]{1,0,0}-k_{C}L_{C}\dot{I}_{L,2}}
Colpitts 2:
Cce,2V˙ce,2\displaystyle C_{ce,2}\dot{V}_{ce,2} =\displaystyle= IL,2Ic[Vbe,2]+1RC(VF,1(Vce,2Vbe,2))\displaystyle I_{L,2}-I_{c}\left[V_{be,2}\right]{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left(V_{F,1}-\left(V_{ce,2}-V_{be,2}\right)\right)}
Cbe,2V˙be,2\displaystyle C_{be,2}\dot{V}_{be,2} =\displaystyle= (Vee+Vbe,2)Ree,2Ib[Vbe,2]IL,21RC[VF,1(Vce,2Vbe,2)]\displaystyle-\frac{\left(V_{ee}+V_{be,2}\right)}{R_{ee,2}}-I_{b}\left[V_{be,2}\right]-I_{L,2}{\color[rgb]{0,0,1}-\frac{1}{R_{C}}\left[V_{F,1}-\left(V_{ce,2}-V_{be,2}\right)\right]}
LCI˙L,2\displaystyle L_{C}\dot{I}_{L,2} =\displaystyle= VccVce,2+Vbe,2RL,2IL,2kCLCI˙L,1\displaystyle V_{cc}-V_{ce,2}+V_{be,2}-R_{L,2}I_{L,2}{\color[rgb]{1,0,0}-k_{C}L_{C}\dot{I}_{L,1}}
Colpitts 3:
Cce,3V˙ce,3\displaystyle C_{ce,3}\dot{V}_{ce,3} =\displaystyle= IL,3Ic[Vbe,3]+1RC(VF,2(Vce,3Vbe,3))\displaystyle I_{L,3}-I_{c}\left[V_{be,3}\right]{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left(V_{F,2}-\left(V_{ce,3}-V_{be,3}\right)\right)}
Cbe,3V˙be,3\displaystyle C_{be,3}\dot{V}_{be,3} =\displaystyle= (Vee+Vbe,3)Ree,3Ib[Vbe,3]IL,31RC[VF,2(Vce,3Vbe,3)]\displaystyle-\frac{\left(V_{ee}+V_{be,3}\right)}{R_{ee,3}}-I_{b}\left[V_{be,3}\right]-I_{L,3}{\color[rgb]{0,0,1}-\frac{1}{R_{C}}\left[V_{F,2}-\left(V_{ce,3}-V_{be,3}\right)\right]}
LCI˙L,3\displaystyle L_{C}\dot{I}_{L,3} =\displaystyle= VccVce,3+Vbe,3RL,3IL,3kCLCI˙L,4\displaystyle V_{cc}-V_{ce,3}+V_{be,3}-R_{L,3}I_{L,3}{\color[rgb]{1,0,0}-k_{C}L_{C}\dot{I}_{L,4}}
Colpitts 4:
Cce,4V˙ce,4\displaystyle C_{ce,4}\dot{V}_{ce,4} =\displaystyle= IL,4Ic[Vbe,4]+1RC(VF,2(Vce,4Vbe,4))\displaystyle I_{L,4}-I_{c}\left[V_{be,4}\right]{\color[rgb]{0,0,1}+\frac{1}{R_{C}}\left(V_{F,2}-\left(V_{ce,4}-V_{be,4}\right)\right)}
Cbe,4V˙be,4\displaystyle C_{be,4}\dot{V}_{be,4} =\displaystyle= (Vee+Vbe,4)Ree,4Ib[Vbe,4]IL,41RC[VF,2(Vce,4Vbe,4)]\displaystyle-\frac{\left(V_{ee}+V_{be,4}\right)}{R_{ee,4}}-I_{b}\left[V_{be,4}\right]-I_{L,4}{\color[rgb]{0,0,1}-\frac{1}{R_{C}}\left[V_{F,2}-\left(V_{ce,4}-V_{be,4}\right)\right]}
LCI˙L,4\displaystyle L_{C}\dot{I}_{L,4} =\displaystyle= VccVce,4+Vbe,4RL,4IL,4kCLCI˙L,3\displaystyle V_{cc}-V_{ce,4}+V_{be,4}-R_{L,4}I_{L,4}{\color[rgb]{1,0,0}-k_{C}L_{C}\dot{I}_{L,3}}

The Colpitts nonlinearity arises from its transistor (2N2222) with gain:

Ib={0,VbeVthVbeVthRon,Vbe>Vth,Ic=βfIb.I_{b}=\begin{cases}0,&V_{be}\leq V_{th}\\ \frac{V_{be}-V_{th}}{R_{on}},&V_{be}>V_{th}\end{cases},\qquad I_{c}=\beta_{f}I_{b}. (61)

The FHN nonlinearity arises from the operational amplifier (AD844) which is arranged to provide a piecewise linear cubic function [49] in the form: f(VF,i)=[VF,ih(VF,i)]/R1,if(V_{F,i})=[V_{F,i}-h(V_{F,i})]/R_{1,i}, where

h(VF)={VR+,VFR4,iVR+R2,i+R4,i(R2,iR4,i+1)VF,R4,iVR+R2,i+R4,i<VF<R4,iVR+R2,i+R4,iVR+,VFR4,iVR+R2,i+R4,i.h(V_{F})=\begin{cases}-V_{R_{+}},&V_{F}\leq\frac{-R_{4,i}V_{R_{+}}}{R_{2,i}+R_{4,i}}\\ \left(\frac{R_{2,i}}{R_{4,i}}+1\right)V_{F},&\frac{-R_{4,i}V_{R_{+}}}{R_{2,i}+R_{4,i}}<V_{F}<\frac{R_{4,i}V_{R_{+}}}{R_{2,i}+R_{4,i}}\\ V_{R_{+}},&V_{F}\geq\frac{R_{4,i}V_{R_{+}}}{R_{2,i}+R_{4,i}}.\end{cases} (62)

Here, VR+=6.5VV_{R_{+}}=6.5V is inferred from the FHN amplitude. Note that the expression h(VF)h(V_{F}) is independent of R2,iR_{2,i} and R4,iR_{4,i} if R2,i=R4,iR_{2,i}=R_{4,i}.

To study the cluster synchronization dynamics of this multilayer system, we vary one coupling and hold the others constant. We vary the Colpitts intralayer coupling, kCk_{C}, by finely varying the separation of the inductors of the Colpitts. We immobilize Colpitts layer nodes C1C_{1} and C3C_{3}, and move C2C_{2} and C4C_{4} with a caliper; this precisely and simultaneously changes the C1C_{1} to C2C_{2} and C3C_{3} to C4C_{4} separation. We impose the constant Colpitts-FHN intralayer coupling, RCR_{C},with a fixed resistor. We hold the FHN-jumper intralayer coupling, kFJk_{FJ}, constant as well; we impose a constant separation between the inductors of the FHN and the jumper with plastic clips.

This experimental testbed differs fundamentally from the numerical examples we consider. Although we model our circuit as noise-free, electrical circuits are subject to several kinds of noise, including shot noise, burst noise, and thermal noise [59, 60]. Components such as transistors and operational amplifiers have noise profiles, with stronger noise at higher frequencies. Additionally, we neglect stray resistance, inductance, and capacitance which inevitably arises even in circuits which are carefully crafted to minimize such issues. Finally, small parameter mismatches lead the oscillators in each layer to be slightly heterogeneous; uncoupled, the nodes have slightly different frequencies and amplitudes.

To write the system in the general form (1), we first assume identical oscillators on each layer, i.e., LJ1=LJ2=LFJ;L_{J1}=L_{J2}=L_{FJ}; LF1,J1=LF2,J2=LFJ;~{}L_{F1,J1}=L_{F2,J2}=L_{FJ}; LF,1=LF,2=LF;~{}L_{F,1}=L_{F,2}=L_{F}; CF,1=CF,2=CF;~{}C_{F,1}=C_{F,2}=C_{F}; R3,1=R3,2=R3;~{}R_{3,1}=R_{3,2}=R_{3}; Cce,1=Cce,2=Cce,3=Cce,4=Cce;~{}C_{ce,1}=C_{ce,2}=C_{ce,3}=C_{ce,4}=C_{ce}; Cbe,1=Cbe,2=Cbe,3=Cbe,4=Cbe;~{}C_{be,1}=C_{be,2}=C_{be,3}=C_{be,4}=C_{be}; LC,1=LC,2=LC,3=LC,4=LC;~{}L_{C,1}=L_{C,2}=L_{C,3}=L_{C,4}=L_{C}; Ree,1=Ree,2=Ree,3=Ree,4=Ree.~{}R_{ee,1}=R_{ee,2}=R_{ee,3}=R_{ee,4}=R_{ee}. We can then write

x˙iα=Fα(xiα)+σααj=1NαAijααHαα(xjα)intra-layer coupling+βασαβj=1NβAijαβHαβ(xjβ).inter-layer coupling\dot{\textbf{x}}_{i}^{\alpha}=F^{\alpha}({\textbf{x}}_{i}^{\alpha})+\underbrace{\sigma^{\alpha\alpha}\sum_{j=1}^{N^{\alpha}}A^{\alpha\alpha}_{ij}H^{\alpha\alpha}({\textbf{x}}_{j}^{\alpha})}_{\text{intra-layer coupling}}+\underbrace{\sum_{\beta\neq\alpha}\sigma^{\alpha\beta}\sum_{j=1}^{N^{\beta}}A^{\alpha\beta}_{ij}H^{\alpha\beta}({\textbf{x}}_{j}^{\beta}).}_{\text{inter-layer coupling}} (63)

Where x1α=IJx_{1}^{\alpha}=I_{J}, x2α=VJx_{2}^{\alpha}=V_{J} are the current and the voltage in the jumper; xi,1β=IF,ix_{i,1}^{\beta}=I_{F,i}, xi,2β=VF,ix_{i,2}^{\beta}=V_{F,i} are the current and the voltage of FHN ii; xi,1γ=Vce,ix_{i,1}^{\gamma}=V_{ce,i}, xi,2γ=Vbe,ix_{i,2}^{\gamma}=V_{be,i}, xi,3γ=IL,ix_{i,3}^{\gamma}=I_{L,i} are the voltages and the current of Colpitts ii.

Jumper layer:

Fα(xα)=((RJx1α+x2αvJ0)/(2LFJ(kFJ2LFJLF))x1α/CJ),{\textbf{F}}^{\alpha}({\textbf{x}}^{\alpha})=\begin{pmatrix}(R_{J}x_{1}^{\alpha}+x_{2}^{\alpha}-v_{J}^{0})/\left(2L_{FJ}(k_{FJ}^{2}L_{FJ}-L_{F})\right)\\ x_{1}^{\alpha}/C_{J}\end{pmatrix},
Hαβ(xiβ)=(2(R3xi,1βxi,2β)0),σαβ=kFJ2(LFLFJkFJ2),Aαβ=[11]{\textbf{H}}^{\alpha\beta}({\textbf{x}}_{i}^{\beta})=\begin{pmatrix}2(R_{3}x_{i,1}^{\beta}-x_{i,2}^{\beta})\\ 0\end{pmatrix},\quad\sigma^{\alpha\beta}=\frac{k_{FJ}}{2(L_{F}-L_{FJ}k_{FJ}^{2})},\quad A^{\alpha\beta}=\begin{bmatrix}1&1\end{bmatrix}

FHN layer

Fβ(xβ)=((2LF(R3x1βx2β)kFJLFvJ0)/(2LF(LFkFJ2LFJ))(f(x2β)x1β2x2β/RC)/CF),{\textbf{F}}^{\beta}({\textbf{x}}^{\beta})=\begin{pmatrix}(-2L_{F}(R_{3}x^{\beta}_{1}-x^{\beta}_{2})-k_{FJ}L_{F}v^{0}_{J})/\left(2L_{F}(L_{F}-k_{FJ}^{2}L_{FJ})\right)\\ (-f(x_{2}^{\beta})-x_{1}^{\beta}-2x_{2}^{\beta}/R_{C})/C_{F}\end{pmatrix},
Hββ(xjβ)=(R3xj,1βxj,2β0),σββ=LFJkFJ22LF(LFJkFJ2LF),Aββ=[1111]{\textbf{H}}^{\beta\beta}({\textbf{x}}_{j}^{\beta})=\begin{pmatrix}R_{3}x_{j,1}^{\beta}-x_{j,2}^{\beta}\\ 0\end{pmatrix},\quad\sigma^{\beta\beta}=\frac{L_{FJ}k_{FJ}^{2}}{2L_{F}(L_{FJ}k_{FJ}^{2}-L_{F})},\quad A^{\beta\beta}=\begin{bmatrix}-1&1\\ 1&-1\end{bmatrix}
Hβα(xα)=(RJx1α+x2α0),σβα=kFJ2(LFLFJkFJ2)=σαβ,Aβα=[11]=(Aαβ)T.{\textbf{H}}^{\beta\alpha}({\textbf{x}}^{\alpha})=\begin{pmatrix}R_{J}x_{1}^{\alpha}+x_{2}^{\alpha}\\ 0\end{pmatrix},\quad\sigma^{\beta\alpha}=\frac{k_{FJ}}{2(L_{F}-L_{FJ}k_{FJ}^{2})}=\sigma^{\alpha\beta},\quad A^{\beta\alpha}=\begin{bmatrix}1\\ 1\end{bmatrix}=(A^{\alpha\beta})^{T}.
Hβγ(xβ,xγ)=(0(x1γx2γ)/CF),σβγ=1RC,Aβγ=[11000011].{\textbf{H}}^{\beta\gamma}({\textbf{x}}^{\beta},{\textbf{x}}^{\gamma})=\begin{pmatrix}0\\ (x_{1}^{\gamma}-x_{2}^{\gamma})/C_{F}\end{pmatrix},\quad\sigma^{\beta\gamma}=\frac{1}{R_{C}},\quad A^{\beta\gamma}=\begin{bmatrix}1&1&0&0\\ 0&0&1&1\end{bmatrix}.

Note that the inductive coupling through the jumper generates a diffusive coupling in the β\beta layer (as can be seen in AββA^{\beta\beta}). This is a consequence of the fact that the inductive coupling acts on the derivative of the current I˙F,i\dot{I}_{F,i}, see the orange terms in the Jumper equations. As a result, this induces a direct diffusive coupling between the currents IF,iI_{F,i} of the FHN circuits. This is represented in figure 4 by a dashed line in the β\beta layer.

Colpitts layer

Fγ(xγ)=((x3γIC(x2γ)(x1γx2γ)/RC)/Cce((Vee+x2γ)/ReeIb(x2γ)x3γ+(x1γx2γ)/RC))/Cbe(x2γx1γRLx3γ+VCC(1kC))/(L(1kC2))),{\textbf{F}}^{\gamma}({\textbf{x}}^{\gamma})=\begin{pmatrix}(x^{\gamma}_{3}-I_{C}(x^{\gamma}_{2})-(x^{\gamma}_{1}-x^{\gamma}_{2})/R_{C})/C_{ce}\\ (-(V_{ee}+x_{2}^{\gamma})/R_{ee}-I_{b}(x_{2}^{\gamma})-x_{3}^{\gamma}+(x_{1}^{\gamma}-x_{2}^{\gamma})/R_{C}))/C_{be}\\ (x_{2}^{\gamma}-x_{1}^{\gamma}-R_{L}x_{3}^{\gamma}+V_{CC}(1-k_{C}))/(L(1-k_{C}^{2}))\end{pmatrix},
Hγγ(xjγ)=(00(xj,2γxj,1γRLxj,3γ)),σγγ=kCL(1kC2),Aγγ=[0100100000010010]{\textbf{H}}^{\gamma\gamma}({\textbf{x}}_{j}^{\gamma})=\begin{pmatrix}0\\ 0\\ -(x_{j,2}^{\gamma}-x_{j,1}^{\gamma}-R_{L}x_{j,3}^{\gamma})\end{pmatrix},\quad\sigma^{\gamma\gamma}=\frac{k_{C}}{L(1-k_{C}^{2})},\quad A^{\gamma\gamma}=\begin{bmatrix}0&1&0&0\\ 1&0&0&0\\ 0&0&0&1\\ 0&0&1&0\end{bmatrix}
Hγβ(xβ,xγ)=(x2β/Ccex2β/Cbe0),σβγ=1RC=σγβ,Aγβ=(Aβγ)T.{\textbf{H}}^{\gamma\beta}({\textbf{x}}^{\beta},{\textbf{x}}^{\gamma})=\begin{pmatrix}x_{2}^{\beta}/C_{ce}\\ x_{2}^{\beta}/C_{be}\\ 0\end{pmatrix},\quad\sigma^{\beta\gamma}=\frac{1}{R_{C}}=\sigma^{\gamma\beta},\quad A^{\gamma\beta}=(A^{\beta\gamma})^{T}.

Acknowledgements

This work was supported by the National Science Foundation through grant (Grant No. 1727948) and the Office of Naval Research through the Naval Research Laboratory’s Basic Research Program. We thank B.Hunt for noting that the equivalence classes of each layer form cosets of a subgroup of that layer’s group and M. Hossein-Zadeh and K. Huang for their support with the experimental activities.

Author contributions

F.D.R., L.P., and F.S. worked on the theory. K.B. performed the experiment with the help of F.D.R. A.S. worked on the analysis of real data. I.K. designed the algorithm for generating multilayer networks with symmetries. F.S. supervised all aspects of the project. F.S. wrote the paper with the help of K.B. and L.P.

Competing interests

The authors declare no competing interests.

References

  • [1] Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E. & Havlin, S. Catastrophic cascade of failures in interdependent networks. Nature 464, 1025–1028 (2010).
  • [2] Korkali, M., Veneman, J. G., Tivnan, B. F., Bagrow, J. P. & Hines, P. D. Reducing cascading failure risk by increasing infrastructure network interdependence. Scientific Reports 7, 44499 (2017).
  • [3] Rezai, A., Keshavarzi, P. & Moravej, Z. Key management issue in scada networks: A review. Engineering science and technology, an international journal 20, 354–363 (2017).
  • [4] Rosato, V. et al. Modelling interdependent infrastructures using interacting dynamical models. International Journal of Critical Infrastructures 4, 63–18 (2008).
  • [5] Pereda, A. E. Electrical synapses and their functional interactions with chemical synapses. Nature Reviews Neuroscience 15, 250–263 (2014).
  • [6] Song, X., Wang, C., Ma, J. & Tang, J. Transition of electric activity of neurons induced by chemical and electric autapses. Science China Technological Sciences 58, 1007–1014 (2015).
  • [7] Adhikari, B. M., Prasad, A. & Dhamala, M. Time-delay-induced phase-transition to synchrony in coupled bursting neurons. Chaos: An Interdisciplinary Journal of Nonlinear Science 21, 023116 (2011).
  • [8] Sorrentino, F. Synchronization of hypernetworks of coupled dynamical systems. New Journal of Physics 14, 033035 (2012).
  • [9] Goulding, M. Circuits controlling vertebrate locomotion: moving in a new direction. Nature Reviews Neuroscience 10, 507 (2009).
  • [10] Lodi, M., Shilnikov, A. & Storace, M. Design of synthetic central pattern generators producing desired quadruped gaits. IEEE Transactions on Circuits and Systems I 65, 1028–1039 (2018).
  • [11] Danner, S. M., Wilshin, S. D., Shevtsova, N. A. & Rybak, I. A. Central control of interlimb coordination and speed-dependent gait expression in quadrupeds. The Journal of Physiology 594, 6947–6967 (2016).
  • [12] Kivela, M. et al. Multilayer networks. Journal of Complex Networks 2, 203–271 (2014).
  • [13] Boccaletti, S. et al. The structure and dynamics of multilayer networks. Physics Reports 544, 1–122 (2014).
  • [14] Taylor, D., Shai, S., Stanley, N. & Mucha, P. J. Enhanced detectability of community structure in multilayer networks through layer aggregation. Physical review letters 116, 228301 (2016).
  • [15] Irving, D. & Sorrentino, F. Synchronization of a hypernetwork of coupled dynamical systems. Physical Review E 86, 056102 (2012).
  • [16] del Genio, C. I., Gómez-Gardeñes, J., Bonamassa, I. & Boccaletti, S. Synchronization in networks with multiple interaction layers. Science Advances 2, e1601679 (2016).
  • [17] Belykh, V. N., Belykh, I. V. & Mosekilde, E. Cluster synchronization modes in an ensemble of coupled chaotic oscillators. Physical Review E 63, 036216 (2001).
  • [18] Belykh, V. N., Osipov, G. V., Petrov, V. S., Suykens, J. A. & Vandewalle, J. Cluster synchronization in oscillatory networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 18, 037106 (2008).
  • [19] Nicosia, V., Valencia, M., Chavez, M., Díaz-Guilera, A. & Latora, V. Remote synchronization reveals network symmetries and functional modules. Physical Review Letters 110, 174102 (2013).
  • [20] Pecora, L., Sorrentino, F., Hagerstrom, A., Murphy, T. & Roy, R. Cluster synchronization and isolated desynchronization in complex networks with symmetries. Nature Communications 5, 4079 (2014).
  • [21] Sorrentino, F., Pecora, L. M., Hagerstrom, A. M., Murphy, T. E. & Roy, R. Complete characterization of the stability of cluster synchronization in complex dynamical networks. Science Advances 2, e1501737 (2016).
  • [22] Sorrentino, F. & Pecora, L. Approximate cluster synchronization in networks with symmetries and parameter mismatches. Chaos: An Interdisciplinary Journal of Nonlinear Science 26, 094823 (2016).
  • [23] Cho, Y. S., Nishikawa, T. & Motter, A. E. Stable chimeras and independently synchronizable clusters. Physical Review Letters 119, 084101 (2017).
  • [24] Siddique, A. B., Pecora, L., Hart, J. D. & Sorrentino, F. Symmetry-and input-cluster synchronization in networks. Physical Review E 97, 042217 (2018).
  • [25] Golubitsky, M. & Stewart, I. Rigid patterns of synchrony for equilibria and periodic cycles in network dynamics. Chaos: An Interdisciplinary Journal of Nonlinear Science 26, 094803 (2016).
  • [26] Belykh, I., Belykh, V., Nevidin, K. & Hasler, M. Persistent clusters in lattices of coupled nonidentical chaotic systems. Chaos: An Interdisciplinary Journal of Nonlinear Science 13, 165–178 (2003).
  • [27] Schaub, M. T. et al. Graph partitions and cluster synchronization in networks of oscillators. Chaos: An Interdisciplinary Journal of Nonlinear Science 26, 094821 (2016).
  • [28] MacArthur, B. D., Sánchez-García, R. J. & Anderson, J. W. Symmetry in complex networks. Discrete Applied Mathematics (2008).
  • [29] Klickstein, I. S. & Sorrentino, F. Generating graphs with symmetry. IEEE Transactions on Network Science and Engineering (2018).
  • [30] Skardal, P. S. Symmetry and symmetry breaking in coupled oscillator communities. The European Physical Journal B 92, 46 (2019).
  • [31] Blaha, K. A. et al. Cluster synchronization in multilayer networks: A fully analog experiment with l c oscillators with physically dissimilar coupling. Physical Review Letters 122, 014101 (2019).
  • [32] Verbrugge, L. M. Multiplexity in adult friendships. Social Forces 57, 1286–1309 (1979).
  • [33] Solá, L. et al. Eigenvector centrality of nodes in multiplex networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 23, 033131 (2013).
  • [34] Gomez, S. et al. Diffusion dynamics on multiplex networks. Physical Review Letters 110, 028701 (2013).
  • [35] Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A. & Pedreschi, D. Multidimensional networks: foundations of structural analysis. World Wide Web 16, 567–593 (2013).
  • [36] Coscia, M., Rossetti, G., Pennacchioli, D., Ceccarelli, D. & Giannotti, F. You know because i know: a multidimensional network approach to human resources problem. In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 434–441 (ACM, 2013).
  • [37] Tang, L., Wu, X., Lü, J., Lu, J.-a. & D’Souza, R. M. Master stability functions for complete, intralayer, and interlayer synchronization in multiplex networks of coupled rössler oscillators. Physical Review E 99, 012304 (2019).
  • [38] MacArthur, B. D. & Sánchez-García, R. J. Spectral characteristics of network redundancy. Physical Review E 80, 026117 (2009).
  • [39] Sorrentino, F., Siddique, A. B. & Pecora, L. M. Symmetries in the time-averaged dynamics of networks: Reducing unnecessary complexity through minimal network models. Chaos: An Interdisciplinary Journal of Nonlinear Science 29, 011101 (2019).
  • [40] De Domenico, M., Solé-Ribalta, A., Gómez, S. & Arenas, A. Navigability of interconnected networks under random failures. Proceedings of the National Academy of Sciences 111, 8351–8356 (2014).
  • [41] Cardillo, A. et al. Emergence of network features from multiplexity. Scientific reports 3, 1344 (2013).
  • [42] De Domenico, M., Lancichinetti, A., Arenas, A. & Rosvall, M. Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Physical Review X 5, 011027 (2015).
  • [43] Coleman, J., Katz, E. & Menzel, H. The diffusion of an innovation among physicians. Sociometry 20, 253–270 (1957).
  • [44] De Domenico, M., Nicosia, V., Arenas, A. & Latora, V. Structural reducibility of multilayer networks. Nature communications 6, 6864 (2015).
  • [45] Stark, C. et al. Biogrid: a general repository for interaction datasets. Nucleic acids research 34, D535–D539 (2006).
  • [46] Rossi, R. A. & Ahmed, N. K. The network data repository with interactive graph analytics and visualization. In AAAI (2015). URL http://networkrepository.com.
  • [47] Klickstein, I., Pecora, L. & Sorrentino, F. Symmetry induced group consensus. Chaos: An Interdisciplinary Journal of Nonlinear Science 29, 073101 (2019).
  • [48] Clifford, A. H. Representations induced in an invariant subgroup. Annals of Mathematics 533–550 (1937).
  • [49] Keener, J. P. Analog circuitry for the van der pol and fitzhugh-nagumo equations. IEEE Transactions on Systems, Man, and Cybernetics SMC-13, 1010–1014 (1983).
  • [50] Kennedy, M. Chaos in the colpitts oscillator. IEEE Transactions on Circuits and Systems 41, 771–774 (1994).
  • [51] Ishizaki, T., Chakrabortty, A. & Imura, J.-I. Graph-theoretic analysis of power systems. Proceedings of the IEEE 106, 931–952 (2018).
  • [52] MacArthur, B. D., Sánchez-García, R. J. & Anderson, J. W. Symmetry in complex networks. Discrete Applied Mathematics 156, 3525–3531 (2008).
  • [53] Sorrentino, F., Pecora, L. M. & Trajkovic, L. Group consensus in multilayer networks. IEEE Transactions on Network Science and Engineering (early access) (2020).
  • [54] Leyva, I. et al. Relay synchronization in multiplex networks. Scientific Reports 8, 1–11 (2018).
  • [55] Group, G. et al. Gap–groups, algorithms, and programming, version 4.4. 12 (2008). https://www.gap-system.org.
  • [56] Stein, W. et al. Sage: Software for algebra and geometry experimentation (2006). http://www.sagemath.org.
  • [57] McKay, B. D. et al. Practical graph isomorphism (Department of Computer Science, Vanderbilt University Tennessee, US, 1981).
  • [58] McKay, B. D. & Piperno, A. Practical graph isomorphism, ii. Journal of Symbolic Computation 60, 94–112 (2014).
  • [59] Instruments, T. Noise analysis in operational amplifier circuits. Application Report, SLVA043B (2007).
  • [60] Bryant, J. & Counts, L. Ask the applications engineer—7: Op-amp noise .