Characterization and Control of Conservative and Non-conservative Network Dynamics

Wildemeersch, Matthias ORCID:, Ronald Chan, Wai Hong, Rovenskaya, Elena ORCID:, & Quek, Tony Q.S. (2018). Characterization and Control of Conservative and Non-conservative Network Dynamics. IFAC Journal of Systems and Control 5 22-29. 10.1016/j.ifacsc.2018.07.002.

[thumbnail of IFAC_201808.pdf]
IFAC_201808.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (389kB) | Preview


Diffusion processes are instrumental to describe the movement of a continuous quantity in a network of interacting agents. Here, we present a framework for diffusion in networks and study in particular two classes of agent interactions depending on whether the total network quantity follows a conservation law. Focusing on probabilistic, asymmetric interactions between agents, we define how the dynamics of conservative and non-conservative networks relate to the weighted in-degree and out-degree Laplacians. For uncontrolled networks, we compare the convergence behavior of both types of networks as a function of the eigenvectors of the weighted graph Laplacians. For networks with exogenous controls, we also analyze convergence and provide a method to measure the difference between conservative and non-conservative network dynamics based on the comparison of their respective reachable sets. The presented network control framework enables the comparative study of the dynamic and asymptotic network behavior for conservative and non-conservative networks.

Item Type: Article
Uncontrolled Keywords: Multi-agent networks; Diffusion process; Directed graphs; Graph Laplacian; Network control; Reachable set
Research Programs: Advanced Systems Analysis (ASA)
Ecosystems Services and Management (ESM)
Depositing User: Luke Kirwan
Date Deposited: 14 Aug 2018 06:22
Last Modified: 27 Aug 2021 17:30

Actions (login required)

View Item View Item