An universal algorithm for source location in complex networks

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.