Global state synchronization in networks of cyclic feedback systems

This technical note studies global asymptotic state synchronization in networks of identical systems. Conditions on the coupling strength required for the synchronization of nodes having a cyclic feedback structure are deduced using incremental dissipativity theory. The method takes advantage of the incremental passivity properties of the constituent subsystems of the network nodes to reformulate the synchronization problem as one of achieving incremental passivity by coupling. The method can be used in the framework of contraction theory to constructively build a contracting metric for the incremental system. The result is illustrated for a network of biochemical oscillators. © 2011 IEEE.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Reconstruction of arbitrary biochemical reaction networks: A compressive sensing approach

Reconstruction of biochemical reaction networks (BRN) and genetic regulatory networks (GRN) in particular is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with ODE model descriptions containing polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated parameters. To solve the network reconstruction problem, we cast it as a compressive sensing (CS) problem and use sparse Bayesian learning (SBL) algorithms as a computationally efficient and robust way to obtain its solution. © 2012 IEEE.

Dynamical structure function identifiability conditions enabling signal structure reconstruction

Networks of controlled dynamical systems exhibit a variety of interconnection patterns that could be interpreted as the structure of the system. One such interpretation of system structure is a system's signal structure, characterized as the open-loop causal dependencies among manifest variables and represented by its dynamical structure function. Although this notion of structure is among the weakest available, previous work has shown that if no a priori structural information is known about the system, not even the Boolean structure of the dynamical structure function is identifiable. Consequently, one method previously suggested for obtaining the necessary a priori structural information is to leverage knowledge about target specificity of the controlled inputs. This work extends these results to demonstrate precisely the a priori structural information that is both necessary and sufficient to reconstruct the network from input-output data. This extension is important because it significantly broadens the applicability of the identifiability conditions, enabling the design of network reconstruction experiments that were previously impossible due to practical constraints on the types of actuation mechanisms available to the engineer or scientist. The work is motivated by the proteomics problem of reconstructing the Per-Arnt-Sim Kinase pathway used in the metabolism of sugars. © 2012 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Analysis of interconnected oscillators by dissipativity theory

This paper employs dissipativity theory for the global analysis of limit cycles in particular dynamical systems of possibly high dimension. Oscillators are regarded as open systems that satisfy a particular dissipation inequality. It is shown that this characterization has implications for the global stability analysis of limit cycle oscillations: i) in isolated oscillators, ii) in interconnections of oscillators, and iii) for the global synchrony analysis in interconnections of identical oscillators. © 2007 IEEE.

Feedback mechanisms for global oscillations in Lure systems

The paper presents two mechanisms for global oscillations in feedback systems, based on bifurcations in absolutely stable systems. The external characterization of the oscillators provides the basis for a (energy-based) dissipativity theory for oscillators, thereby opening new possibilities for rigorous stability analysis of high-dimensional systems and interconnected oscillators. © 2004 Elsevier B.V. All rights reserved.

Dissipativity characterization of a class of oscillators and networks of oscillators

This paper uses dissipativity theory to provide the system-theoretic description of a basic oscillation mechanism. Elementary input-output tools are then used to prove the existence and stability of limit cycles in these "oscillators". The main benefit of the proposed approach is that it is well suited for the analysis and design of interconnections, thus providing a valuable mathematical tool for the study of networks of coupled oscillators.