Abstract
We consider the problem of learning the weighted edges of a graph by observing the noisy times of infection for multiple epidemic cascades on this graph. Past work has considered this problem when the cascade information, i.e., infection times, are known exactly. Though the noisy setting is well motivated by many epidemic processes (e.g., most human epidemics), to the best of our knowledge, very little is known about when it is solvable. Previous work on the no-noise setting critically uses the ordering information. If noise can reverse this -- a node's reported (noisy) infection time comes after the reported infection time of some node it infected -- then we are unable to see how previous results can be extended. We therefore tackle two versions of the noisy setting: the limited-noise setting, where we know noisy times of infections, and the extreme-noise setting, in which we only know whether or not a node was infected. We provide a polynomial time algorithm for recovering the structure of bidirectional trees in the extreme-noise setting, and show our algorithm matches lower bounds established in the no-noise setting, and hence is optimal. We extend our results for general degree-bounded graphs, where again we show that our (poly-time) algorithm can recover the structure of the graph with optimal sample complexity. We also provide the first efficient algorithm to learn the weights of the bidirectional tree in the limited-noise setting. Finally, we give a polynomial time algorithm for learning the weights of general bounded-degree graphs in the limited-noise setting. This algorithm extends to general graphs (at the price of exponential running time), proving the problem is solvable in the general case. All our algorithms work for any noise distribution, without any restriction on the variance.
- Bruno Abrahao, Flavio Chierichetti, Robert Kleinberg, and Alessandro Panconesi. 2013. Trace complexity of network inference. Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13 (2013), 491. arxiv: arXiv:1308.2954v1 Google Scholar
Digital Library
- Ery Arias-castro, Emmanuel J Candès, and Arnaud Durand. 2011. Detection of an anomalous cluster in a network. The Annals of Statistics, Vol. 39, 1 (2011), 278--304. arxiv: arXiv:1001.3209v2Google Scholar
Cross Ref
- Ery Arias-castro and S T Nov. {n. d.}. Detecting a Path of Correlations in a Network. ( {n. d.}), 1--12. arxiv: arXiv:1511.01009v1Google Scholar
- Daniel Bernoulli and Sally Blower. 2004. An attempt at a new analysis of the mortality caused by smallpox and of the advantages of inoculation to prevent it. Reviews in medical virology, Vol. 14 (2004), 275--288.Google Scholar
- A. Cayley. 1897. A theorem on trees. In Collected Mathematical Papers Vol. 13. Cambridge University Press, 26--28.Google Scholar
- Justin Cheng, Lada A. Adamic, P. Alex Dow, Jon Kleinberg, and Jure Leskovec. 2014. Can Cascades be Predicted?. In Proceedings of the 23rd international conference on World wide web (WWW' 14). arxiv: 1403.4608Google Scholar
Digital Library
- Michela Del Vicario, Alessandro Bessi, Fabiana Zollo, Fabio Petroni, Antonio Scala, Guido Caldarelli, H. Eugene Stanley, and Walter Quattrociocchi. 2016. The spreading of misinformation online. Proceedings of the National Academy of Sciences (2016), 201517441.Google Scholar
Cross Ref
- A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal ofthe Royal Statistical Society, Vol. 39, 1 (1977), 1--38.Google Scholar
- Kimon Drakopoulos, Asuman Ozdaglar, and John N. Tsitsiklis. 2014. An efficient curing policy for epidemics on graphs. arXiv preprint arXiv:1407.2241 December (2014), 1--10. arxiv: arXiv:1407.2241v1Google Scholar
- Kimon Drakopoulos, Asuman Ozdaglar, and John N. Tsitsiklis. 2015. A lower bound on the performance of dynamic curing policies for epidemics on graphs. 978 (2015), 3560--3567. arxiv: 1510.06055Google Scholar
- Giulia Fanti, Peter Kairouz, Sewoong Oh, Kannan Ramchandran, and Pramod Viswanath. 2016. Rumor source obfuscation on irregular trees. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science (SIGMETRICS' 16 ). ACM, 153--164. Google Scholar
Digital Library
- Giulia Fanti, Peter Kairouz, Sewoong Oh, Kannan Ramchandran, and Pramod Viswanath. 2017. Hiding the Rumor Source. IEEE Transactions on Information Theory, Vol. 63, 10 (2017), 6679--6713. arxiv: 1509.02849Google Scholar
Digital Library
- Giulia Fanti, Peter Kairouz, Sewoong Oh, and Pramod Viswanath. 2015. Spy vs. Spy: Rumor Source Obfuscation. Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS' 14) (2015), 271--284. arxiv: 1412.8439 Google Scholar
Digital Library
- Mehrdad Farajtabar, Jiachen Yang, Xiaojing Ye, Huan Xu, Rakshit Trivedi, Elias Khalil, Shuang Li, Le Song, and Hongyuan Zha. 2017. Fake News Mitigation via Point Process Based Intervention. In Proceedings of the 34th International Conference on Machine Learning (ICML' 17) .arxiv: 1703.07823 http://arxiv.org/abs/1703.07823 Google Scholar
Digital Library
- Ken Goldberg, Theresa Roeder, Dhruv Gupta, and Chris Perkins. 2001. Eigentaste: A Constant Time Collaborative Filtering Algorithm. Information Retrieval, Vol. 4, 2 (2001), 133--151. arxiv: arXiv:astro-ph/0005074v1Google Scholar
Digital Library
- Manuel Gomez-rodriguez, Jure Leskovec, and Andreas Krause. 2012. Inferring Networks of Diffusion and Influence. In ACM Transactions on Knowledge Discovery from Data (TKDD' 12), Vol. 5. Google Scholar
Digital Library
- Manuel Gomez-Rodriguez, Jure Leskovec, and Bernhard Schö lkopf. 2013. Structure and Dynamics of Information Pathways in Online Media. In 6th International Conference on Web Search and Data Mining (WSDM 2013) . Google Scholar
Digital Library
- Jessica Hoffmann and Constantine Caramanis. 2018. The Cost of Uncertainty in Curing Epidemics. Proceedings of the ACM on Measurement and Analysis of Computing Systems (SIGMETRICS' 18), Vol. 2, 2 (2018), 11--13.Google Scholar
- Tomoharu Iwata, Amar Shah, and Zoubin Ghahramani. 2013. Discovering Latent Influence in Online Social Activities via Shared Cascade Poisson Processes. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD' 13) .Google Scholar
Digital Library
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03. arxiv: 0806.2034v2Google Scholar
Digital Library
- Justin Khim and Po-Ling Loh. 2017. Permutation Tests for Infection Graphs. (2017), 1--28. arxiv: 1705.07997 http://arxiv.org/abs/1705.07997Google Scholar
- Justin Khim and Po-Ling Loh. 2018. A theory of maximum likelihood for weighted infection graphs. (2018), 1--47. arxiv: arXiv:1806.05273v1 https://arxiv.org/pdf/1806.05273.pdfGoogle Scholar
- Joseph B. Kruskal. 1956. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. Amer. Math. Soc., Vol. 7, 1 (1956), 48--50. http://www.jstor.org/stable/2033241Google Scholar
Cross Ref
- Jeongyeol Kwon, Wei Qian, Constantine Caramanis, Yudong Chen, and Damek Davis. 2019. Global Convergence of the EM Algorithm for Mixtures of Two Component Linear Regression., Vol. XX (2019), 1--57. arxiv: arXiv:1810.05752v3Google Scholar
- Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective Outbreak Detection in Networks. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '07) (2007), 420. Google Scholar
Digital Library
- Eli A. Meirom, Chris Milling, Constantine Caramanis, Shie Mannor, Ariel Orda, and Sanjay Shakkottai. 2014. Localized epidemic detection in networks with overwhelming noise. (2014), 1--27. arxiv: 1402.1263 http://arxiv.org/abs/1402.1263 Google Scholar
Digital Library
- Chris Milling, Constantine Caramanis, Shie Mannor, and Sanjay Shakkottai. 2012. Network Forensics : Random Infection vs Spreading Epidemic. In Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems (SIGMETRICS' 12) . Google Scholar
Digital Library
- Chris Milling, Constantine Caramanis, Shie Mannor, and Sanjay Shakkottai. 2015. Local detection of infections in heterogeneous networks. Proceedings - IEEE INFOCOM, Vol. 26 (2015), 1517--1525.Google Scholar
- Seth Myers, Chenguang Zhu, and Jure Leskovec. 2012. Information Diffusion and External Influence in Networks. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD' 12). 33--41. Google Scholar
Digital Library
- Praneeth Netrapalli and Sujay Sanghavi. 2012. Learning the Graph of Epidemic Cascades. In Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems (SIGMETRICS' 12). 211--222. arxiv: 1202.1779Google Scholar
Digital Library
- M. E. J. Newman. 2014. Networks: An Introduction. Vol. 23. 73--75 pages.Google Scholar
- Devavrat Shah and Tauhid Zaman. 2010a. Detecting sources of computer viruses in networks: theory and experiment. In ACM SIGMETRICS Performance Evaluation Review, Vol. 38. ACM, 203--214. Google Scholar
Digital Library
- Devavrat Shah and Tauhid Zaman. 2010b. Rumors in a Network : Who ' s the Culprit IEEE Transactions on information theory, Vol. 57, 8 (2010), 1--43. arxiv: 0909.4370 Google Scholar
Digital Library
- Devavrat Shah and Tauhid Zaman. 2012. Rumor centrality: a universal source detector. In ACM SIGMETRICS Performance Evaluation Review, Vol. 40. ACM, 199--210. Google Scholar
Digital Library
- Sam Spencer and R Srikant. 2015. On the impossibility of localizing multiple rumor sources in a line graph. ACM SIGMETRICS Performance Evaluation Review, Vol. 43, 2 (2015), 66--68. Google Scholar
Digital Library
- Zhaoxu Wang, Wenxiang Dong, Wenyi Zhang, and Chee Wei Tan. 2014. Rumor source detection with multiple observations: Fundamental limits and algorithms. In ACM SIGMETRICS Performance Evaluation Review, Vol. 42. ACM, 1--13. Google Scholar
Digital Library
- Liang Wu and Huan Liu. 2018. Tracing Fake-News Footprints: Characterizing Social Media Messages by How They Propagate. In (WSDM 2018) The 11th ACM International Conference on Web Search and Data Mining. Google Scholar
Digital Library
- Ali Zarezade, Ali Khodadadi, Mehrdad Farajtabar, Hamid R Rabiee, and Hongyuan Zha. 2017. Correlated Cascades : Compete or Cooperate. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17). 238--244. Google Scholar
Digital Library
- Qingyuan Zhao, Murat A. Erdogdu, Hera Y. He, Anand Rajaraman, and Jure Leskovec. 2015. SEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularity. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15 ) (2015). arxiv: 1506.02594 Google Scholar
Digital Library
Index Terms
Learning Graphs from Noisy Epidemic Cascades
Recommendations
Learning the graph of epidemic cascades
Performance evaluation reviewWe consider the problem of finding the graph on which an epidemic spreads, given only the times when each node gets infected. While this is a problem of central importance in several contexts -- offline and online social networks, e-commerce, ...
Learning Graphs from Noisy Epidemic Cascades
Epidemic models accurately represent (among other processes) the spread of diseases, information (rumors, viral videos, news stories, etc.), the spread of malevolent agents in a network (computer viruses, malicious apps, etc.), or even biological ...
Learning Graphs from Noisy Epidemic Cascades
SIGMETRICS '19: Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsEpidemic models accurately represent (among other processes) the spread of diseases, information (rumors, viral videos, news stories, etc.), the spread of malevolent agents in a network (computer viruses, malicious apps, etc.), or even biological ...






Comments