The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Controllability Transition and Nonlocality in Network Control
Open accessAbstract
A common goal in the control of a large network is to minimize the number of driver nodes or control inputs. Yet, the physical determination of control signals and the properties of the resulting control trajectories remain widely underexplored. Here we show that (i) numerical control fails in practice even for linear systems if the controllability Gramian is ill conditioned, which occurs frequently even when existing controllability criteria are satisfied unambiguously, (ii) the control trajectories are generally nonlocal in the phase space, and their lengths are strongly anti-correlated with the numerical success rate and number of control inputs, and (iii) numerical success rate increases abruptly from zero to nearly one as the number of control inputs is increased, a transformation we term numerical controllability transition. This reveals a trade-off between nonlocality of the control trajectory in the phase space and nonlocality of the control inputs in the network itself. The failure of numerical control cannot be overcome in general by merely increasing numerical precision--successful control requires instead increasing the number of control inputs beyond the numerical controllability transition.
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
Newman, 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
Cited by
Controllability Metrics, Limitations and Algorithms for Complex Networks
Pasqualetti, F., Zampieri, S., & Bullo, F. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2310254 · Cited by 594
Spectrum 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
Optimally controlling the human connectome: the role of network topology
Betzel, R. F., Gu, S., Medaglia, J. D., Pasqualetti, F., & Bassett, D. S. (2016) · Scientific Reports · doi:10.1038/srep30770 · Cited by 247
Metadata
- Authors
- Sun, J., & Motter, A. E.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2013-05-14
- Volume
- 110
- Issue
- 20
- Pages
- 208701-208701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1977106787
- Cited by
- 192
- References
- 2
- FWCI
- 16.98
- Type
- journal article
- Language
- en
- Open access
- green
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: Controllability Transition and Nonlocality in Network Control. https://app.cochat.ai/papers/10.1103/physrevlett.110.208701
- The paper
- Sun, J., & Motter, A. E. (2013). Controllability Transition and Nonlocality in Network Control. Physical Review Letters. https://doi.org/10.1103/physrevlett.110.208701
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.