The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Controlling Complex Networks: How Much Energy Is Needed?
Open accessAbstract
The outstanding problem of controlling complex networks is relevant to many areas of science and engineering, and has the potential to generate technological breakthroughs as well. We address the physically important issue of the energy required for achieving control by deriving and validating scaling laws for the lower and upper energy bounds. These bounds represent a reasonable estimate of the energy cost associated with control, and provide a step forward from the current research on controllability toward ultimate control of complex networked dynamical systems.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Lewis, F. L. (1986) · Cited by 2,948
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“On one hand, the couplings between nodes increase the complexity of collective behaviors, which stimulates much interest of modeling, analyzing, and predicting dynamical processes on complex networks [3].”
BackgroundScale-Free Networks: A Decade and Beyond
Barabási, A.-L. (2009) · Science · doi:10.1126/science.1173299 · Cited by 2,109
Rugh, W. J. (1992) · Cited by 1,395
Pinning a Complex Dynamical Network to Its Equilibrium
Li, X., Wang, X., & Chen, G. (2004) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2004.835655 · Cited by 954
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
Barabási, A.-L. (2012) · Nature Physics · doi:10.1038/nphys2188 · Cited by 502
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
Klipp, E., Liebermeister, W., Wierling, C., Kowald, A., Lehrach, H. R., & Herwig, R. (2009) · Cited by 308
Feedback for physicists: A tutorial essay on control
Bechhoefer, J. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.783 · Cited by 300
Optimizing controllability of complex networks by minimum structural perturbations
Wang, W.-X., Ni, X., Lai, Y.-C., & Grebogi, C. (2012) · Physical Review E · doi:10.1103/physreve.85.026115 · Cited by 246
Self-citationNoise Bridges Dynamical Correlation and Topology in Coupled Oscillator Networks
Ren, J., Wang, W.-X., Li, B., & Lai, Y.-C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.058701 · Cited by 191
Self-citationProbabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks
Ilya Shmulevich, C., & Dougherty, E. R. (2010) · Cited by 176
Controllability analysis of networks
Lombardi, A., & Hörnquist, M. (2007) · Physical Review E · doi:10.1103/physreve.75.056110 · Cited by 133
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
Global controllability with a single local actuator
Schirmer, S. G., Pullen, I. C. H., & Pemberton-Ross, P. J. (2008) · Physical Review A · doi:10.1103/physreva.78.062339 · Cited by 40
Noncommutative optimal control and quantum networks
Yanagisawa, M. (2006) · Physical Review A · doi:10.1103/physreva.73.022342 · Cited by 5
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
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
Exact controllability of complex networks
Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y.-C. (2013) · Nature Communications · doi:10.1038/ncomms3447 · Cited by 565
Self-citationThe fundamental advantages of temporal networks
Li, A., Cornelius, S. P., Liu, Y.-Y., Wang, L., & Barabási, A.-L. (2017) · Science · doi:10.1126/science.aai7488 · Cited by 495
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
- Yan, G., Ren, J., Lai, Y.-C., Lai, C.-H., & Li, B.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-05-23
- Volume
- 108
- Issue
- 21
- Pages
- 218703-218703
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2104109956
- Cited by
- 413
- References
- 25
- FWCI
- 23.11
- Type
- journal article
- Language
- en
- Open access
- green
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.