Characterization and Control of Conservative and Nonconservative Network Dynamics

Wildemeersch, M. ORCID: https://orcid.org/0000-0002-6660-2712, Chan, W.H.R., Rovenskaya, E. ORCID: https://orcid.org/0000-0002-2761-3443, & Quek, T.Q.S. (2016). Characterization and Control of Conservative and Nonconservative Network Dynamics. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-16-026

Preview

Text WP-16-026.pdf - Published Version Available under License Creative Commons Attribution. Download (503kB) | Preview

Abstract

Diffusion processes are instrumental to describe the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic 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 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 define the convergence behavior of our framework, including the case of variable network topologies, as a function of the eigenvalues and eigenvectors of the weighted graph Laplacian. In addition, we study the control of the network dynamics by means of external controls and alterations in the network topology. For networks with exogenous controls, we analyze convergence and provide a method to measure the difference between conservative and non-conservative network dynamics based on the comparison of their respective attainability domains. In order to construct a network topology tailored for a desired behavior, we propose a Markov decision process (MDP) that learns specific network adjustments through a reinforcement learning algorithm. The presented network control and design schemes enable the alteration of the dynamic and stationary network behavior in conservative and non-conservative networks.

Actions (login required)

View Item