Efficient target control of complex networks based on preferential matching.
Controlling a complex network towards a desired state is of great importance in many applications. Existing works present an approximate algorithm to find the input nodes used to control partial nodes of the network. However, the input nodes obtained by this algorithm depend on the node matching ord...
Main Authors: | Xizhe Zhang, Huaizhen Wang, Tianyang Lv |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2017-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5383299?pdf=render |
Similar Items
-
Structural controllability of complex networks based on preferential matching.
by: Xizhe Zhang, et al.
Published: (2014-01-01) -
Complex cooperative networks from evolutionary preferential attachment.
by: Julia Poncela, et al.
Published: (2008-01-01) -
Identifying node role in social network based on multiple indicators.
by: Shaobin Huang, et al.
Published: (2014-01-01) -
Temporal Behavior of Local Characteristics in Complex Networks with Preferential Attachment-Based Growth
by: Sergei Sidorov, et al.
Published: (2021-08-01) -
Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications
by: Zhongtuan Zheng, et al.
Published: (2017-01-01)