eprintid: 14389 rev_number: 14 eprint_status: archive userid: 2 dir: disk0/00/01/43/89 datestamp: 2017-02-21 14:14:38 lastmod: 2021-08-27 17:28:34 status_changed: 2017-02-21 14:14:38 type: monograph metadata_visibility: show item_issues_count: 1 creators_name: Wildemeersch, M. creators_name: Chan, W.H.R. creators_name: Rovenskaya, E. creators_name: Quek, T.Q.S. creators_id: 2075 creators_id: 8206 creators_orcid: 0000-0002-6660-2712 creators_orcid: 0000-0002-2761-3443 corp_creators: Pavel Kabat, Director General and CEO, IIASA title: Characterization and Control of Conservative and Nonconservative Network Dynamics ispublished: pub divisions: prog_asa keywords: multi-agent networks, diffusion process, directed graphs, graph Laplacian, network control, network design 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. date: 2016-12 date_type: published publisher: WP-16-026 creators_browse_id: 331 creators_browse_id: 260 full_text_status: public monograph_type: working_paper place_of_pub: IIASA, Laxenburg, Austria coversheets_dirty: FALSE fp7_project: yes fp7_project_id: info:eu-repo/grantAgreement/EC/FP7/323947/EU/Reassessing Ageing from a Population Perspective/RE-AGEING fp7_type: info:eu-repo/semantics/book access_rights: info:eu-repo/semantics/openAccess citation: 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 document_url: https://pure.iiasa.ac.at/id/eprint/14389/1/WP-16-026.pdf