Learning network structures from contagion

From MaRDI portal
Publication:509882

DOI10.1016/J.IPL.2017.01.005zbMATH Open1404.68089arXiv1705.10051OpenAlexW2578994151MaRDI QIDQ509882FDOQ509882

Jittat Fakcharoenphol, Adisak Supeesun

Publication date: 21 February 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: In 2014, Amin, Heidari, and Kearns proved that tree networks can be learned by observing only the infected set of vertices of the contagion process under the independent cascade model, in both the active and passive query models. They also showed empirically that simple extensions of their algorithms work on sparse networks. In this work, we focus on the active model. We prove that a simple modification of Amin et al.'s algorithm works on more general classes of networks, namely (i) networks with large girth and low path growth rate, and (ii) networks with bounded degree. This also provides partial theoretical explanation for Amin et al.'s experiments on sparse networks.


Full work available at URL: https://arxiv.org/abs/1705.10051





Cites Work


Cited In (1)


Recommendations





This page was built for publication: Learning network structures from contagion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509882)