An universal algorithm for source location in complex networks

Hongjue Wang

Physica A: Statistical Mechanics and its Applications, 2019, vol. 514, issue C, 620-630

Abstract: We study locating propagation source in complex networks. We proposed an universal algorithm, which can accurately locate source of different propagation dynamics by using sparse observations. Without knowing the propagation dynamics and any parameters, we calculate Spearman centrality based on the character that positive correlation between inform time of nodes and geodesic distance between nodes and source. The algorithm have high location accuracy with low time complexity and can accurately infer initial time of source. All simulations on both model and real-world networks proved the feasibility and validity of this algorithm.

Keywords: Propagation dynamics; Source; Complex networks; Spearman’s correlation; Initial time (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437118312470
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:514:y:2019:i:c:p:620-630

DOI: 10.1016/j.physa.2018.09.114

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().