Title 



Efficiently spotting the starting points of an epidemic in a large graph
 
Author 



 
Abstract 



Given a snapshot of a large graph, in which an infection has been spreading for some time, can we identify those nodes from which the infection started to spread? In other words, can we reliably tell who the culprits are? In this paper, we answer this question affirmatively and give an efficient method called NetSleuth for the wellknown susceptibleinfected virus propagation model. Essentially, we are after that set of seed nodes that best explain the given snapshot. We propose to employ the minimum description length principle to identify the best set of seed nodes and virus propagation ripple, as the one by which we can most succinctly describe the infected graph. We give an highly efficient algorithm to identify likely sets of seed nodes given a snapshot. Then, given these seed nodes, we show we can optimize the virus propagation ripple in a principled way by maximizing likelihood. With all three combined, NetSleuth can automatically identify the correct number of seed nodes, as well as which nodes are the culprits. Experimentation on our method shows high accuracy in the detection of seed nodes, in addition to the correct automatic identification of their number. Moreover, NetSleuth scales linearly in the number of nodes of the graph.   
Language 



English
 
Source (journal) 



Knowledge and information systems: an international journal.  London  
Publication 



London : 2014
 
ISSN 



02191377
 
Volume/pages 



38:1(2014), p. 3559
 
ISI 



000329944900002
 
Full text (Publisher's DOI) 


  
Full text (publisher's version  intranet only) 


  
