The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Target control of complex networks
Open accessAbstract
Controlling large natural and technological networks is an outstanding challenge. It is typically neither feasible nor necessary to control the entire network, prompting us to explore target control: the efficient control of a preselected subset of nodes. We show that the structural controllability approach used for full control overestimates the minimum number of driver nodes needed for target control. Here we develop an alternate ‘k-walk’ theory for directed tree networks, and we rigorously prove that one node can control a set of target nodes if the path length to each target node is unique. For more general cases, we develop a greedy algorithm to approximate the minimum set of driver nodes sufficient for target control. We find that degree heterogeneous networks are target controllable with higher efficiency than homogeneous networks and that the structure of many real-world networks are suitable for efficient target control. Network controllability has numerous applications in natural and technological systems. Here, Gao et al.develop a theoretical approach and a greedy algorithm to study target control—the ability to efficiently control a preselected subset of nodes—in complex networks.
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
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
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
Self-citationNewman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Self-citationDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
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
Self-citationFlavor mystery of Chinese traditional fermented baijiu: The great contribution of ester compounds
Xu, Y., Zhao, J., Liu, X., Zhang, C., Zhao, Z., Li, X., & Sun, B. (2022) · Food Chemistry · doi:10.1016/j.foodchem.2021.130920 · Cited by 553
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
Levin, M. (2022) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2022.768201 · Cited by 195
McCutcheon, R. A., Nour, M. M., Dahoun, T., Jauhar, S., Pepper, F., Expert, P., Veronese, M., Adams, R. A., Turkheimer, F., Mehta, M. A., et al. (2019) · Biological Psychiatry · doi:10.1016/j.biopsych.2018.09.010 · Cited by 104
Metadata
- Authors
- Gao, J., Liu, Y.-Y., D'Souza, R. M., & Barabási, A.-L.
- Venue
- Nature Communications
- Published
- 2014-11-12
- Volume
- 5
- Issue
- 1
- Pages
- 5415-5415
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2170723553
- Cited by
- 404
- References
- 6
- FWCI
- 21.97
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Target control of complex networks. https://app.cochat.ai/papers/10.1038/ncomms6415
- The paper
- Gao, J., Liu, Y.-Y., D'Souza, R. M., & Barabási, A.-L. (2014). Target control of complex networks. Nature Communications. https://doi.org/10.1038/ncomms6415
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.