.png){kind=icon}
.png){kind=icon}
Return
Sparse Resource Allocation for Linear Network Spread Dynamics
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2016.2593895.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse resource allocation to shape a network dynamical process is studied. Specifically, we consider allocating limited distributed control resources among a subset of a network's nodes, to minimize the dominant eigenvalue of a linear dynamical spread process associated with the network. Structural characterizations of the closed-loop dynamics at the optimum are obtained. These results are then used to 1) develop constructive algorithms for optimal resource allocation, 2) identify limits on the control performance, and 3) understand the relationship between the network's graph and the optimal resource profile. While the focus here is on a simplified linear model, an exploratory study of the design's applicability to realistic stochastic and nonlinear spread processes is undertaken, via simulation examples. As a whole, this study advances a research thrust on disease spread control in networks, toward the realistic paradigm that control resources can only be allocated at a subset of network locations.
Keywords:
Control of networks
network theory (graphs)
optimal control
spread processes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations