Comparison of observer based methods for source localisation in complex networks

Abstract

In recent years, research on methods for locating a source of spreading phenomena in complex networks has seen numerous advances. Such methods can be applied not only to searching for the “patient zero” in epidemics, but also finding the true sources of false or malicious messages circulating in the online social networks. Many methods for solving this problem have been established and tested in various circumstances. Yet, we still lack reviews that would include a direct comparison of efficiency of these methods. In this paper, we provide a thorough comparison of several observer-based methods for source localisation on complex networks. All methods use information about the exact time of spread arrival at a pre-selected group of vertices called observers. We investigate how the precision of the studied methods depends on the network topology, density of observers, infection rate, and observers’ placement strategy. The direct comparison between methods allows for an informed choice of the methods for applications or further research. We find that the Pearson correlation based method and the method based on the analysis of multiple paths are the most effective in networks with synthetic or real topologies. The former method dominates when the infection rate is low; otherwise, the latter method takes over.

Document Details

Document Type
Pub Defense Publication
Publication Date
Mar 24, 2022
Source ID
10.1038/s41598-022-09031-0

Entities

People

  • Adam Sulik
  • Boleslaw Szymanski
  • Janusz A. Hołyst
  • Krzysztof Suchecki
  • Robert Paluch
  • Łukasz G. Gajewski

Organizations

  • Defense Advanced Research Projects Agency
  • Russian Science Foundation

Tags

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Networking
  • Theoretical Analysis.