Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 246

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Optimizing controllability of complex networks by minimum structural perturbations

Wang, Wen-Xu, Ni, Xuan, Lai, Ying-Cheng, Grebogi, Celso · 2012 · Physical Review E

Abstract

To drive a large, complex, networked dynamical system toward some desired state using as few external signals as possible is a fundamental issue in the emerging field of controlling complex networks. Optimal control is referred to the situation where such a network can be fully controlled using only one driving signal. We propose a general approach to optimizing the controllability of complex networks by judiciously perturbing the network structure. The principle of our perturbation method is validated theoretically and demonstrated numerically for homogeneous and heterogeneous random networks and for different types of real networks as well. The applicability of our method is discussed in terms of the relative costs of establishing links and imposing external controllers. Besides the practical usage of our approach, its implementation elucidates, interestingly, the intricate relationship between certain structural properties of the network and its controllability.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.85.026115

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 246

Metadata

Authors
Wang, W.-X., Ni, X., Lai, Y.-C., & Grebogi, C.
Venue
Physical Review E
Published
2012-02-22
Volume
85
Issue
2
Pages
026115-026115
ISSN
  • 1539-3755 (ISSN-L)
  • 1550-2376
OpenAlex
W2046955087
Cited by
246
References
3
FWCI
18.73
Type
journal article
Language
en
Open access
closed

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: Optimizing controllability of complex networks by minimum structural perturbations. https://app.cochat.ai/papers/10.1103/physreve.85.026115
The paper
Wang, W.-X., Ni, X., Lai, Y.-C., & Grebogi, C. (2012). Optimizing controllability of complex networks by minimum structural perturbations. Physical Review E. https://doi.org/10.1103/physreve.85.026115

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.