The DOI matches its Crossref record; 41 of the 41 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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
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
Self-citationSlotine, J.-J. E., & Li, W. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 18,975
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
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Self-citationThe Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Self-citationAn $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
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 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
Self-citationThe 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
Network control principles predict neuron function in the Caenorhabditis elegans connectome
Yan, G., Vértes, P. E., Towlson, E. K., Chew, Y. L., Walker, D. S., Schafer, W. R., & Barabási, A.-L. (2017) · Nature · doi:10.1038/nature24056 · Cited by 345
Self-citationSahlgren, C., Meinander, A., Zhang, H., Cheng, F., Preis, M., Xu, C., Salminen, T. A., Toivola, D., Abankwa, D., Rosling, A., et al. (2017) · Advanced Healthcare Materials · doi:10.1002/adhm.201700258 · Cited by 315
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
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
Optimal control of aging in complex networks
Sun, E. D., Michaels, T. C. T., & Mahadevan, L. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2006375117 · Cited by 31
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
- 41
- 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
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.