Abstract | ||
---|---|---|
Malignant propagation events in networks, such as large-scale diffusion of computer viruses, rumors and failures, have caused massive damage to our society. Thus, it is critical to study how to identify the propagation source. However, existing source identification algorithms only quantify the impact mechanisms of part of the factors that affect the Maximum Likelihood Estimator (MLE) of propagation source, which result in reduced source identification accuracy. In this paper, through constructing a mathematical model for propagation process, we derive two node properties, called Average Eccentricity and Infection Force, which quantify the impact mechanisms of all the factors that affect the MLE of propagation source. And then, we design an AEIF source identification algorithm based on the above two node properties, which make AEIF algorithm has improved accuracy and lower time complexity than existing algorithm. Finally, in the experimental part, extensive simulations on various synthetic networks and real-world networks demonstrate the outperformance of AEIF algorithm than existing algorithms, and based on the experimental results, some assignment suggestions of parameters in AEIF algorithm are given. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-030-38991-8_17 | ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING (ICA3PP 2019), PT I |
Keywords | DocType | Volume |
Propagation source identification, Complex network, Average Eccentricity, Infection Force, AEIF algorithm | Conference | 11944 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhong Li | 1 | 160 | 30.32 |
Chunhe Xia | 2 | 63 | 18.30 |
Tianbo Wang | 3 | 0 | 2.03 |
Xiaochen Liu | 4 | 16 | 10.79 |