Evidence map›Paper›PMID 25388503›Full record

ArticleNature communications2014

Target control of complex networks.

Jianxi Gao, Yang-Yu Liu, Raissa M D'Souza, Albert-László Barabási

Abstract read
In one paragraph

Article in Nature communications, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 94 papers.

0numbers the graph read from it
0cells of the map it votes in
94citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

94 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
  6. Article
  7. The Controllability ofBiomimetics (Basel, Switzerland) · 2025
    Article
  8. Article
  9. Low-dimensional controllability of brain networks.PLoS computational biology · 2025
    Article
  10. Article
  11. Review
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Review
  20. Article

34 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jianxi GaoCenter for Complex Network Research and Department of Physics, Northeastern University, Boston, Massachusetts 02115, USA.
Yang-Yu Liu1] Center for Complex Network Research and Department of Physics, Northeastern University, Boston, Massachusetts 02115, USA [2] Center for Cancer Systems Biology, Dana-Farber Cancer Institute, Boston, Massachusetts 02115, USA [3] Department of Medicine and Channing Division of Network Medicine, Brigham and Women's Hospital, Harvard Medical School, Boston, Massachusetts 02115, USA.
Raissa M D'Souza1] Complexity Sciences Center, Department of Mechanical and Aerospace Engineering, and Department of Computer Science, University of California, Davis, California 95616, USA [2] Santa Fe Institute, Santa Fe, New Mexico 87501, USA.
Albert-László Barabási1] Center for Complex Network Research and Department of Physics, Northeastern University, Boston, Massachusetts 02115, USA [2] Center for Cancer Systems Biology, Dana-Farber Cancer Institute, Boston, Massachusetts 02115, USA [3] Department of Medicine and Channing Division of Network Medicine, Brigham and Women's Hospital, Harvard Medical School, Boston, Massachusetts 02115, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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.

Identifiers

PMID25388503
PMCPMC4243219

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-SA
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.