• DocumentCode
    138678
  • Title

    Detecting multiple information sources in networks under the SIR model

  • Author

    Zhen Chen ; Kai Zhu ; Lei Ying

  • Author_Institution
    Sch. of Electr., Comput. & Energy Eng., Arizona State Univ., Tempe, AZ, USA
  • fYear
    2014
  • fDate
    19-21 March 2014
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this paper, we study the problem of detecting multiple information sources in networks under the Susceptible-Infected-Recovered (SIR) model. First, assuming the number of information sources is known, we develop a sample-path-based algorithm, named clustering and localization, for trees. For g-regular trees, the estimators produced by the proposed algorithm are within a constant distance from the real sources with a high probability. We further present a heuristic algorithm for general networks and an algorithm for estimating the number of sources when the number of real sources is unknown.
  • Keywords
    network theory (graphs); pattern clustering; security of data; trees (mathematics); SIR model; g-regular tree; heuristic algorithm; multiple information source detection; named clustering; sample path based algorithm; susceptible-infected-recovered model; Approximation algorithms; Clustering algorithms; Computational modeling; Computers; Educational institutions; Heuristic algorithms; Signal processing algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2014 48th Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Type

    conf

  • DOI
    10.1109/CISS.2014.6814143
  • Filename
    6814143