The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Controllability Metrics, Limitations and Algorithms for Complex Networks
Abstract
This paper studies the problem of controlling complex networks, i.e., the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem, 1) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, 2) we derive bounds based on the system dynamics (network topology and weights) to characterize the tradeoff between the control energy and the number of control nodes, and 3) we propose an open-loop control strategy with performance guarantees. In our strategy, we select control nodes by relying on network partitioning, and we design the control input by leveraging optimal and distributed control techniques. Our findings show several control limitations and properties. For instance, for Schur stable and symmetric networks: 1) if the number of control nodes is constant, then the control energy increases exponentially with the number of network nodes; 2) if the number of control nodes is a fixed fraction of the network nodes, then certain networks can be controlled with constant energy independently of the network dimension; and 3) clustered networks may be easier to control because, for sufficiently many control nodes, the control energy depends only on the controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks, social networks and epidemics spreading.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
Power System Stability and Control
Kundur, P. (1994) · Cited by 19,639
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 3×
“However, if each cluster is connected and every diagonal entry 1 Several methods are available to partition a network [33].”
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Zimmerman, R. D., Murillo-Sanchez, C. E., & Thomas, R. J. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2051168 · Cited by 6,756
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Multivariable Feedback Control: Analysis and Design
Skogestad, S., & Postlethwaite, I. (1996) · Cited by 6,312
Kailath, T. (1980) · Cited by 6,215
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Linear Multivariable Control: a Geometric Approach
Wonham, W. M. (1979) · Springer eBooks · doi:10.1007/978-1-4684-0068-7 · Cited by 3,136
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Finite Dimensional Linear Systems
Brockett, R. W. (2015) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973884 · Cited by 1,157
Van Mieghem, P., Omic, J., & Kooij, R. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.925623 · Cited by 1,040
Efficient, High-Quality Force-Directed Graph Drawing
Hu, Y. (2006) · The Mathematica Journal · Cited by 877
Wonham, W. M. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1082-5 · Cited by 809
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
Finite dimensional linear systems
Vidyasagar, M. (1971) · Journal of the Franklin Institute · doi:10.1016/0016-0032(71)90268-7 · Cited by 691
1Synchronization and Transient Stability in Power Networks and Non-Uniform Kuramoto OscillatorsPreprint
Bullo, F. (2016) · Cited by 684
Self-citationControllability of linear dynamical systems
Kalman, R. E. (1963) · Medical Entomology and Zoology · Cited by 602
Generic properties and control of linear structured systems: a survey
Dion, J.-M., Commault, C., & van der Woude, J. (2003) · Automatica · doi:10.1016/s0005-1098(03)00104-3 · Cited by 522
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
Stability of graph communities across time scales
Delvenne, J.-C., Yaliraki, S. N., & Barahona, M. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0903215107 · Cited by 475
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
Bauer, F. L., & Fike, C. T. (1960) · Numerische Mathematik · doi:10.1007/bf01386217 · Cited by 376
Müller, P. C., & Weber, H. I. (1972) · Automatica · doi:10.1016/0005-1098(72)90044-1 · Cited by 344
Multivariable Control A Graph-Theoretic Approach
(1988) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0051585 · Cited by 308
Cowan, N. J., Chastain, E. J., Vilhena, D. A., Freudenberg, J. S., & Bergstrom, C. T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038398 · Cited by 273
Measures of modal controllability and observability for first- and second-order linear systems
Hamdan, A. M. A., & Nayfeh, A. H. (1989) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20424 · Cited by 240
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
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
Optimal placement of actuators in actively controlled structures using genetic algorithms
Rao, S. S., Pan, T.-S., & Venkayya, V. B. (1991) · AIAA Journal · doi:10.2514/3.10683 · Cited by 187
A Survey on Distributed Estimation and Control Applications Using Linear Consensus Algorithms
Garin, F., & Schenato, L. (2010) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-0-85729-033-5_3 · Cited by 182
On the decay rate of Hankel singular values and related issues
Antoulas, A. C., Sorensen, D. C., & Zhou, Y. (2002) · Systems & Control Letters · doi:10.1016/s0167-6911(02)00147-0 · Cited by 182
Method for optimal actuator and sensor placement for large flexible structures
Lim, K. B. (1992) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20800 · Cited by 173
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
Optimization Strategies for Sensor and Actuator Placement
Sharon, L. P., & Rex, K. K. (1999) · NASA Technical Reports Server (NASA) · Cited by 131
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
Few inputs can reprogram biological networks
Müller, F.-J., & Schuppert, A. (2011) · Nature · doi:10.1038/nature10543 · Cited by 109
Dynamics and control of state-dependent networks for probing genomic organization
Rajapakse, I., Groudine, M. T., & Mesbahi, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1113249108 · Cited by 63
Optimal sensor and actuator location for unstable systems
Shaker, H. R., & Tahavori, M. (2012) · Journal of Vibration and Control · doi:10.1177/1077546312451302 · Cited by 50
Marx, B., Koenig, D., & Georges, D. (2004) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2004.1383878 · Cited by 50
System Theoretic Aspects of Influenced Consensus: Single Input Case
Chapman, A., & Mesbahi, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2179345 · Cited by 14
Cited by
Bassett, D. S., & Sporns, O. (2017) · Nature Neuroscience · doi:10.1038/nn.4502 · Cited by 2,398
Controllability of structural brain networks
Gu, S., Pasqualetti, F., Cieslak, M., Telesford, Q. K., Yu, A. B., Kahn, A. E., Medaglia, J. D., Vettel, J. M., Miller, M. B., Grafton, S. T., et al. (2015) · Nature Communications · doi:10.1038/ncomms9414 · Cited by 912
Self-citationSmall-World Brain Networks Revisited
Bassett, D. S., & Bullmore, E. T. (2017) · The Neuroscientist · doi:10.1177/1073858416667720 · Cited by 842
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
The physics of brain network structure, function and control
Lynn, C. W., & Bassett, D. S. (2019) · Nature Reviews Physics · doi:10.1038/s42254-019-0040-8 · Cited by 400
Metadata
- Authors
- Pasqualetti, F., Zampieri, S., & Bullo, F.
- Venue
- IEEE Transactions on Control of Network Systems
- Published
- 2014-03
- Volume
- 1
- Issue
- 1
- Pages
- 40-52
- ISSN
- 2325-5870 (ISSN-L)
- OpenAlex
- W2111725629
- Cited by
- 594
- References
- 46
- FWCI
- 30.98
- 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.