A Mathematical Analysis of Network Controllability Through Driver Nodes.

Sang Peter Chin,Jonathan Cohen, Alison Albin, Mykola Hayvanovych,Elizabeth Reilly,Gavin Brown,Jacob Harer

IEEE Transactions on Computational Social Systems（2017）

引用 8|浏览33

暂无评分

摘要

A May 2011 Nature article by Liu, Slotine, and Barabasi laid a mathematical foundation for analyzing network controllability of self-organizing networks and how to identify the minimum number of nodes needed to control a network, or driver nodes. In this paper, we continue to explore this topic, beginning with a look at how Laplacian eigenvalues relate to the percentage of nodes required to contro...

查看译文

关键词

Eigenvalues and eigenfunctions,Laplace equations,Controllability,Encyclopedias,Symmetric matrices,Control theory,Vehicles

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要