The structure of a complex networked system can be modeled as a graph with nodes representing the agents and the links describing a notion of dynamic coupling between them. Data-driven methods to identify such influence pathways is central to many application domains. However, such dynamically related data-streams originating at different sources are prone to corruption caused by asynchronous time-stamps, packet drops and noise. In this article, we provide a tight characterization of the connectivity structure of the agents that can be constructed based solely on measured data streams that are corrupted. A necessary and sufficient condition that delineates the effects of corruption on a set of nodes is obtained. Here, the generative system that yields the data admits nonlinear dynamic influences between agents and can involve feedback loops. Directed information based concepts are utilized in conjunction with tools from graphical models theory to arrive at the results.
|Original language||English (US)|
|Title of host publication||2018 IEEE Conference on Decision and Control, CDC 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - Jan 18 2019|
|Event||57th IEEE Conference on Decision and Control, CDC 2018 - Miami, United States|
Duration: Dec 17 2018 → Dec 19 2018
|Name||Proceedings of the IEEE Conference on Decision and Control|
|Conference||57th IEEE Conference on Decision and Control, CDC 2018|
|Period||12/17/18 → 12/19/18|
Bibliographical noteFunding Information:
∗Work supported in part by NSF CMMI 1727096. The authors are with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455, USA.email@example.com, firstname.lastname@example.org, email@example.com
Work supported in part by NSF CMMI 1727096.