The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Exact controllability of complex networks
Open accessAbstract
Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural controllability theory, we continue to lack a framework to control undirected complex networks, especially given link weights. Here we introduce an exact controllability paradigm based on the maximum multiplicity to identify the minimum set of driver nodes required to achieve full control of networks with arbitrary structures and link-weight distributions. The framework reproduces the structural controllability of directed networks characterized by structural matrices. We explore the controllability of a large number of real and model networks, finding that dense networks with identical weights are difficult to be controlled. An efficient and accurate tool is offered to assess the controllability of large sparse and dense networks. The exact controllability framework enables a comprehensive understanding of the impact of network properties on controllability, a fundamental problem towards our ultimate control of complex systems. Although it has been possible to calculate the conditions for exerting complete control over a directed complex network, for undirected and weighted networks this calculation is inexact. Yuan et al. develop a general framework for determining the controllability of any complex network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Slotine, J.-J. E., & Li, W. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 18,975
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
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
Target control of complex networks
Gao, J., Liu, Y.-Y., D'Souza, R. M., & Barabási, A.-L. (2014) · Nature Communications · doi:10.1038/ncomms6415 · Cited by 404
The structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
Synchronization in complex networks and its application – A survey of recent advances and challenges
Tang, Y., Qian, F., Gao, H., & Kurths, J. (2014) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2014.09.003 · Cited by 358
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
Self-citationSpectrum of controlling and observing complex networks
Yan, G., Tsekenis, G., Barzel, B., Slotine, J.-J., Liu, Y.-Y., & Barabási, A.-L. (2015) · Nature Physics · doi:10.1038/nphys3422 · Cited by 279
From maps to multi-dimensional network mechanisms of mental disorders
Braun, U., Schaefer, A., Betzel, R. F., Tost, H., Meyer-Lindenberg, A., & Bassett, D. S. (2018) · Neuron · doi:10.1016/j.neuron.2017.11.007 · Cited by 177
Network control principles for identifying personalized driver genes in cancer
Guo, W.-F., Zhang, S.-W., Zeng, T., Akutsu, T., & Chen, L. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbz089 · Cited by 44
Metadata
- Authors
- Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y.-C.
- Venue
- Nature Communications
- Published
- 2013-09-12
- Volume
- 4
- Issue
- 1
- Pages
- 2447-2447
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W1982821381
- Cited by
- 565
- References
- 56
- FWCI
- 35.64
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.