Diffusion Source Inference for Large-Scale Complex Networks Based on Network Percolation

被引:16
作者
Liu, Yang [1 ]
Wang, Xiaoqi [2 ]
Wang, Xi [3 ,4 ]
Wang, Zhen [5 ,6 ]
Kurths, Jurgen [7 ,8 ]
机构
[1] Northwestern Polytech Univ, Sch Artificial Intelligence Opt & Elect IOPEN, Xian 710072, Peoples R China
[2] Northwestern Polytech Univ, Sch Mech Engn, Xian 710072, Peoples R China
[3] Stanford Univ, Dept Radiat Oncol, Sch Med, Palo Alto, CA 94305 USA
[4] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Peoples R China
[5] Northwestern Polytech Univ, Sch Artificial Intelligence, Xian 710072, Peoples R China
[6] Northwestern Polytech Univ, Sch Cybersecur Optic & Elect iOPEN, Xian 710072, Peoples R China
[7] Potsdam Inst Climate Impact Res, D-14473 Potsdam, Germany
[8] Humboldt Univ, Dept Phys, D-12489 Berlin, Germany
基金
中国国家自然科学基金;
关键词
Complex networks; diffusion source inference; evolutionary algorithm; network percolation; spreading dynamics; INTERNET; NODES;
D O I
10.1109/TNNLS.2023.3321767
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article studies the diffusion-source-inference (DSI) problem, whose solution plays an important role in real-world scenarios such as combating misinformation and controlling diffusions of information or disease. The main task of the DSI problem is to optimize an estimator, such that the real source can be more precisely targeted. In this article, we assume that the state of a number of nodes, called observer set, in a network could be investigated if necessary, and study what configuration of those nodes could facilitate a better solution for the DSI problem. In particular, we find that the conventional error distance metric cannot precisely evaluate the effectiveness of varied DSI approaches in heterogeneous networks, and thus propose a novel and more general measurement, the candidate set, that is formulated to contain the diffusion source for sure. We propose the percolation-based evolutionary framework (PrEF) to optimize the observer set such that the candidate set can be minimized. Hence, one could further conduct more intensive investigation or search on only a few nodes to target the source. To achieve that, we first theoretically show that the size of the candidate set is bounded by the size of the largest component cover, and demonstrate that there are some similarities between the DSI problem and the network immunization problem. We find that, given the associated direction information of the diffusion is known on observers, the minimization of the candidate set is equivalent to the minimization of the order parameter if we view the observer set as the removal node set. Hence, PrEF is developed based on the network percolation and evolutionary algorithm. The effectiveness of the proposed method is validated on both synthetic and empirical networks in regard to varied circumstances. Our results show that the developed approach could achieve much smaller candidate sets compared to the state of the art in almost all cases, e.g., it is better in 26 out of 27 empirical networks and 155 out of 162 cases regarding the critical threshold. Meanwhile, our approach is also more stable, i.e., it works well irrespective of varied infection probabilities, diffusion models, and underlying networks. More importantly, we provide a framework for the analysis of the DSI problem in large-scale networks.
引用
收藏
页码:1453 / 1466
页数:14
相关论文
共 56 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]   EPA: Exoneration and Prominence based Age for Infection Source Identification [J].
Ali, Syed Shafat ;
Anwar, Tarique ;
Rastogi, Ajay ;
Rizvi, Syed Afzal Murtaza .
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, :891-900
[3]  
[Anonymous], 2014, P 25 ANN ACM SIAM S, DOI DOI 10.1137/1.9781611973402.70
[4]  
Barabasi AL, 2016, NETWORK SCIENCE, P1
[5]   ADAPTIVE TEST ALLOCATION FOR OUTBREAK DETECTION AND TRACKING IN SOCIAL CONTACT NETWORKS [J].
Batlle, Pau ;
Bruna, Joan ;
Fernandez-Granda, Carlos ;
Preciado, Victor M. .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2022, 60 (02) :S274-S293
[6]  
Brauer F., 2001, MATH MODELS POPULATI
[7]   Network dismantling [J].
Braunstein, Alfredo ;
Dall'Asta, Luca ;
Semerjian, Guilhem ;
Zdeborova, Lenka .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2016, 113 (44) :12368-12373
[8]   Information Sources Estimation in Time-Varying Networks [J].
Chai, Yun ;
Wang, Youguo ;
Zhu, Liang .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 :2621-2636
[9]  
Cho E, 2011, P ACM SIGKDD C KNOWL, P1082
[10]   Information Source Finding in Networks: Querying With Budgets [J].
Choi, Jaeyoung ;
Moon, Sangwoo ;
Woo, Jiin ;
Son, Kyunghwan ;
Shin, Jinwoo ;
Yi, Yung .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (05) :2271-2284