The locatability of Pearson algorithm for multi-source location in complex networks

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.