TL;DR
This paper introduces a concept of network locality that enables scalable control of large nonlinear networks by focusing on localized regions, significantly reducing computational and communication costs.
Contribution
It develops a new locality-based framework for controlling large networks, including algorithms for controllability, driver node placement, and local feedback design, validated on real and model networks.
Findings
Network locality is nearly universal across various networks.
Localized control actions are concentrated in small neighborhoods.
Algorithms achieve near-optimal control with much lower computational costs.
Abstract
The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
