中心性
计算机科学
测地线
算法
复杂网络
节点(物理)
贪婪算法
观察员(物理)
数据挖掘
数学
统计
数学分析
物理
结构工程
量子力学
万维网
工程类
作者
Hongjue Wang,Zhao-Long Hu,Tao Li,Shuyu Shao,Shi-Zhe Wang
标识
DOI:10.1038/s41598-023-32832-w
摘要
Abstract We study locating propagation sources in complex networks. We proposed an multi-source location algorithm for different propagation dynamics by using sparse observations. Without knowing the propagation dynamics and any dynamic parameters, we can calculate node centrality based on the character that positive correlation between inform time of nodes and geodesic distance between nodes and sources. The algorithm is robust and have high location accuracy for any number of sources. We study locatability of the proposed source location algorithm and present a corresponding strategy to select observer nodes based on greedy algorithm. All simulations on both model and real-world networks proved the feasibility and validity of this algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI