The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Pinning-Controllability Analysis of Complex Networks: An M-Matrix Approach
Open accessAbstract
This paper presents a systematic framework to analyze the global pinning-controllability of general complex networks with or without time-delay based on the properties of M-matrices and directed spanning trees. Some stability criteria are established to guarantee that a network can be globally asymptotically pinned to a homogenous state. By partitioning the interaction diagraph into a minimum number of components, a selective pinning scheme for a complex network with arbitrary topology is proposed to determine the number and the locations of the pinned nodes. In particular, this paper deeply investigates the roles of network nodes in the pinning control, including what kind of nodes should be pinned and what kind of nodes may be left unpinned. Numerical simulations are given to verify the theoretical analysis.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 3×
“The Laplacian matrix associated with the adjacency matrix is defined by [28], [30]”
Cited by
Consensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies
Wen, G., Duan, Z., Chen, G., & Yu, W. (2014) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2013.2268091 · Cited by 798
Self-citationSynchronization of Nonlinear Coupled Networks via Aperiodically Intermittent Pinning Control
Liu, X., & Chen, T. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2311838 · Cited by 269
Song, Q., Liu, F., Cao, J., & Yu, W. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227723 · Cited by 262
Self-citationSynchronization on Complex Networks of Networks
Lu, R., Yu, W., Lu, J., & Xue, A. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2305443 · Cited by 262
Self-citationDistributed consensus tracking for multi‐agent systems under two types of attacks
Feng, Z., Hu, G., & Wen, G. (2016) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3342 · Cited by 258
Metadata
- Authors
- Song, Q., Liu, F., Cao, J., & Yu, W.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2012-11
- Volume
- 59
- Issue
- 11
- Pages
- 2692-2701
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2018165711
- Cited by
- 158
- References
- 1
- FWCI
- 21.52
- 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
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.