本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2014-11-12
摘要
Controlling large natural and technological 網絡s is an outstanding challenge. It is typically neither feasible nor necessary to control the entire 網絡, prompting us to explore target control: the efficient control of a preselected subset of nodes. We show that the structural controllability approach used for full control overestimates the minimum number of driver nodes needed for target control. Here we develop an alternate 'k-walk' theory for directed tree 網絡s, and we rigorously prove that one node can control a set of target nodes if the path length to each target node is unique. For more general cases, we develop a greedy algorithm to approximate the minimum set of driver nodes sufficient for target control. We find that degree heterogeneous 網絡s are target controllable with higher efficie
※ 此為已發表論文，全文需透過期刊付費取得