Pinning control on complex networks via identifying communities

Authors:
Yingying Wu;Wei Wei;Ji Xiang
Affiliations:
College of Electrical Engineering, Zhejiang University, Hangzhou, China;College of Electrical Engineering, Zhejiang University, Hangzhou, China;College of Electrical Engineering, Zhejiang University, Hangzhou, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Year:
2009

Citing 4
Cited 0

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linked

Linked
Brief paper: On the V-stability of complex dynamical networks

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the tool of V-Stability, the stability analysis of the controlled network is derived in terms of linear matrix inequality. Then the large scale network is divided into some small communities via a fast division algorithm. The aggregation network is stabilized by stabilizing every community with pinning control strategy. As an illustrative example, a network with 400 nodes is simulated to verify the effectiveness and convenience with the selective pinning control strategy.