Matryoshka and disjoint cluster synchronization of networks

Fibration symmetries and cluster synchronization in the Caenorhabditis elegans connectome

Capturing how the Caenorhabditis elegans connectome structure gives rise to its neuron functionality remains unclear. It is through fiber symmetries found in its neuronal connectivity that synchronization of a group of neurons can be determined. To understand these we investigate graph symmetries and search for such in the symmetrized versions of the forward and backward locomotive sub-networks of the Caenorhabditi elegans worm neuron network. The use of ordinarily differential equations simulations admissible to these graphs are used to validate the predictions of these fiber symmetries and are compared to the more restrictive orbit symmetries. Additionally fibration symmetries are used to decompose these graphs into their fundamental building blocks which reveal units formed by nested loops or multilayered fibers. It is found that fiber symmetries of the connectome can accurately predict neuronal synchronization even under not idealized connectivity as long as the dynamics are within stable regimes of simulations.

Fibration symmetries and cluster synchronization in the Caenorhabditis elegans connectome

Capturing how the Caenorhabditis elegans connectome structure gives rise to its neuron functionality remains unclear. It is through fiber symmetries found in its neuronal connectivity that synchronization of a group of neurons can be determined. To understand these we investigate graph symmetries and search for such in the symmetrized versions of the forward and backward locomotive sub-networks of the Caenorhabditi elegans worm neuron network. The use of ordinarily differential equations simulations admissible to these graphs are used to validate the predictions of these fiber symmetries and are compared to the more restrictive orbit symmetries. Additionally fibration symmetries are used to decompose these graphs into their fundamental building blocks which reveal units formed by nested loops or multilayered fibers. It is found that fiber symmetries of the connectome can accurately predict neuronal synchronization even under not idealized connectivity as long as the dynamics are within stable regimes of simulations.

Endowing networks with desired symmetries and modular behavior

Symmetries in a network regulate its organization into functional clustered states. Given a generic ensemble of nodes and a desirable cluster (or group of clusters), we exploit the direct connection between the elements of the eigenvector centrality and the graph symmetries to generate a network equipped with the desired cluster(s), with such a synthetical structure being furthermore perfectly reflected in the modular organization of the network's functioning. Our results solve a relevant problem of designing a desired set of clusters and are of generic application in all cases where a desired parallel functioning needs to be blueprinted.

Synchronizing chaos using reservoir computing

We attempt to achieve complete synchronization between a drive system unidirectionally coupled with a response system, under the assumption that limited knowledge on the states of the drive is available at the response. Machine-learning techniques have been previously implemented to estimate the states of a dynamical system from limited measurements. We consider situations in which knowledge of the non-measurable states of the drive system is needed in order for the response system to synchronize with the drive. We use a reservoir computer to estimate the non-measurable states of the drive system from its measured states and then employ these measured states to achieve complete synchronization of the response system with the drive.

Hierarchy of partially synchronous states in a ring of coupled identical oscillators

In coupled identical oscillators, complete synchronization has been well formulated; however, partial synchronization still calls for a general theory. In this work, we study the partial synchronization in a ring of N locally coupled identical oscillators. We first establish the correspondence between partially synchronous states and conjugacy classes of subgroups of the dihedral group D_{N}. Then we present a systematic method to identify all partially synchronous dynamics on their synchronous manifolds by reducing a ring of oscillators to short chains with various boundary conditions. We find that partially synchronous states are organized into a hierarchical structure and, along a directed path in the structure, upstream partially synchronous states are less synchronous than downstream ones.

Algebraic Decomposition of Model Predictive Control Problems

This paper is concerned with the application of model predictive control (MPC) to large-scale linear dynamical systems with linear inequality constraints. A decomposition is proposed of such problems into sets of independent MPCs of lower dimensions that preserves all information about the system, cost function, and constraints. Different from previous work, the constraints are incorporated in the decomposition procedure, which is attained by generalizing a previously developed technique to simultaneously block diagonalize a set of matrices. This approach is applied to practical examples involving large-scale systems with inequality constraints. It is shown that the computational complexity and the CPU time required to solve the transformed MPC problems are lower than those required by the solution of the original MPC problem.

Exact Decomposition of Optimal Control Problems via Simultaneous Block Diagonalization of Matrices

In this paper, we consider optimal control problems (OCPs) applied to large-scale linear dynamical systems with a large number of states and inputs. We attempt to reduce such problems into a set of independent OCPs of lower dimensions. Our decomposition is 'exact' in the sense that it preserves all the information about the original system and the objective function. Previous work in this area has focused on strategies that exploit symmetries of the underlying system and of the objective function. Here, instead, we implement the algebraic method of simultaneous block diagonalization of matrices (SBD), which we show provides advantages both in terms of the dimension of the subproblems that are obtained and of the computation time. We provide practical examples with networked systems that demonstrate the benefits of applying the SBD decomposition over the decomposition method based on group symmetries.