The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Minimal Controllability Problems
Abstract
Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the minimum number of variables that need to be affected within a multiplicative factor of clog n is NP-hard for some positive c. On the positive side, we show it is possible to find sets of variables matching this in approximability barrier in polynomial time. This can be done with a simple greedy heuristic which sequentially picks variables to maximize the rank increase of the controllability matrix. Experiments on Erdos-Renyi random graphs that demonstrate this heuristic almost always succeed at finding the minimum number of variables.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“to the emergence of a budding theory of control over networks (see [18], [23], and the references therein).”
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 1×
“These graphs have been the subject of considerable focus within the network controllability literature (see [14] and [28]) due to their use as models of biological interconnection networks [20] We simulate the randomized algorithm for finding the sparsest vector in B.”
BackgroundControllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Mathematical Description of Linear Dynamical Systems
Kalman, R. E. (1963) · Journal of the Society for Industrial and Applied Mathematics Series A Control · doi:10.1137/0301010 · Cited by 1,738
Theory of linear and integer programming
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)91141-5 · Cited by 1,042
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
Rahmani, A., Ji, M., Mesbahi, M., & Egerstedt, M. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060674909 · Cited by 767
A Review of the Applications of Agent Technology in Traffic and Transportation Systems
Chen, B., & Cheng, H. H. (2010) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2010.2048313 · Cited by 605
Controllability Metrics, Limitations and Algorithms for Complex Networks
Pasqualetti, F., Zampieri, S., & Bullo, F. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2310254 · Cited by 594
Observability of complex systems
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1215508110 · Cited by 516
Controlling edge dynamics in complex networks
Nepusz, T., & Vicsek, T. (2012) · Nature Physics · doi:10.1038/nphys2327 · Cited by 430
Controlling Complex Networks: How Much Energy Is Needed?
Yan, G., Ren, J., Lai, Y.-C., Lai, C.-H., & Li, B. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.218703 · Cited by 413
Axler, S. (1997) · Undergraduate Texts in Mathematics · doi:10.1007/b97662 · Cited by 331
Controllability of a Leader–Follower Dynamic Network With Switching Topology
Liu, B., Chu, T., Wang, L., & Xie, G. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.919548 · Cited by 317
A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent Systems
Claes, R., Holvoet, T., & Weyns, D. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2105867 · Cited by 227
On the Reachability and Observability of Path and Cycle Graphs
Parlangeli, G., & Notarstefano, G. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2168912 · Cited by 223
Effect of correlations on network controllability
Pósfai, M., Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2013) · Scientific Reports · doi:10.1038/srep01067 · Cited by 203
Controllability Transition and Nonlocality in Network Control
Sun, J., & Motter, A. E. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.208701 · Cited by 192
(2012) · IEEE Control Systems · doi:10.1109/mcs.2012.2195411 · Cited by 178
Controllability and Observability of Grid Graphs via Reduction and Symmetries
Notarstefano, G., & Parlangeli, G. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2241493 · Cited by 171
Effect of correlations on network controllability
Liu, Y., Pósfai, M., Slotine, J.-J. E., & Barabási, A.-Ĺ. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 171
Controllability analysis of multi-agent systems using relaxed equitable partitions
Martini, S., Egerstedt, M., & Bicchi, A. (2010) · International Journal of Systems Control and Communications · doi:10.1504/ijscc.2010.031160 · Cited by 149
Robustness analysis of network controllability
Pu, C., Pei, W., & Michaelson, A. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.04.019 · Cited by 135
Optimal Sensor and Actuator Placement in Complex Dynamical Networks
Summers, T. H., & Lygeros, J. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.00226 · Cited by 122
Sundaram, S., & Hadjicostis, C. N. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2204155 · Cited by 120
A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
Cao, M., Zhang, S., & Camlibel, M. K. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2208314 · Cited by 64
How to Turn a Genetic Circuit into a Synthetic Tunable Oscillator, or a Bistable Switch
Marucci, L., Barton, D. A. W., Cantone, I., Ricci, M. A., Cosma, M. P., Santini, S., di Bernardo, D., & di Bernardo, M. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008083 · Cited by 47
What Can Systems Theory of Networks Offer to Biology?
Rajapakse, I., Groudine, M. T., & Mesbahi, M. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002543 · Cited by 31
Strong Structural Controllability of Networked Dynamics
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_8 · Cited by 14
Cited by
Control principles of complex systems
Liu, Y.-Y., & Barabási, A.-L. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.035006 · Cited by 654
On Submodularity and Controllability in Complex Dynamical Networks
Summers, T. H., Cortesi, F. L., & Lygeros, J. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2453711 · Cited by 482
Metadata
- Authors
- Olshevsky, A.
- Venue
- IEEE Transactions on Control of Network Systems
- Published
- 2014-09
- Volume
- 1
- Issue
- 3
- Pages
- 249-258
- ISSN
- 2325-5870 (ISSN-L)
- OpenAlex
- W2003949298
- Cited by
- 322
- References
- 28
- FWCI
- 31.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.