Tree sampling for detection of information source in densely connected networks

Taewon Min, Changhee Joo

Research output: Contribution to journalArticlepeer-review


We investigate the problem of source detection in information spreading throughout a densely-connected network. Previous works have been developed mostly for tree networks or applied the tree-network results to non-tree networks assuming that the infection occurs in the breadth first manner. However, these approaches result in low detection performance in densely-connected networks, since there is a substantial number of nodes that are infected through the non-shortest path. In this work, we take a two-step approach to the source detection problem in densely-connected networks. By introducing the concept of detour nodes, we first sample trees that the infection process likely follows and effectively compare the probability of the sampled trees. Our solution has low complexity of O(n2logn), where n denotes the number of infected nodes, and thus can be applied to large-scale networks. Through extensive simulations including practical networks of the Internet autonomous system and power grid, we evaluate our solution in comparison with two well-known previous schemes and show that it achieves the best performance in densely-connected networks.

Original languageEnglish
Article number587
JournalElectronics (Switzerland)
Issue number5
Publication statusPublished - 2019 May
Externally publishedYes


  • Approximation
  • Estimation
  • Source detection

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Signal Processing
  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Tree sampling for detection of information source in densely connected networks'. Together they form a unique fingerprint.

Cite this