no code implementations • 21 Jun 2022 • Nafiseh Ghoroghchian, Rajasekhar Anguluri, Gautam Dasarathy, Stark C. Draper
We consider the controllability of large-scale linear networked dynamical systems when complete knowledge of network structure is unavailable and knowledge is limited to coarse summaries.
no code implementations • 29 Sep 2021 • Nafiseh Ghoroghchian, Rajasekhar Anguluri, Gautam Dasarathy, Stark Draper
In contrast, in this paper the controllability aspects of the coarse system are derived from coarse summaries {\em without} knowledge of the fine-scale structure.
1 code implementation • 25 Feb 2021 • Nafiseh Ghoroghchian, Gautam Dasarathy, Stark C. Draper
Our objective is to develop conditions on the graph structure, the quantity, and properties of measurements, under which we can recover the community organization in this coarse graph.
no code implementations • 4 Nov 2020 • Nafiseh Ghoroghchian, David M. Groppe, Roman Genov, Taufik A. Valiante, Stark C. Draper
This is particularly true when the number of nodes is high or there are temporal changes in the network.
no code implementations • 25 Oct 2020 • Nafiseh Ghoroghchian, Stark C. Draper, Roman Genov
Such a model maps signals onto vertices of a graph and the time-space dependencies among signals are modeled by the edge weights.