Discovering multiple diffusion source nodes in social networks

Procedia Computer Science

Volumn 29, Issue , 2014, Pages 443-452

  Zang, Wenyu ^a,b   Zhang, Peng ^b   Zhou, Chuan ^b   Guo, Li ^b  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b Chinese Academy of Sciences   (China)

Author keywords

Communities; Complex networks; Multi source; Source locating

Indexed keywords

COMPUTER VIRUSES; ECOSYSTEMS; LOCATION; SOCIAL NETWORKING (ONLINE);

CLUSTER ALGORITHMS; DIFFUSION SOURCES; LIKELIHOOD ESTIMATION; MULTI-SOURCES; MULTIPLE SOURCE; PROPAGATION METHOD; SOURCE LOCATING; SPREAD OF INFORMATIONS;

COMPLEX NETWORKS;

EID: 84902778846     PISSN: 18770509     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.procs.2014.05.040     Document Type: Conference Paper

References (24)

1. Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing. Mixed membership stochastic blockmodels. The Journal of Machine Learning Research, 9:1981-2014, 2008.
2. Roy M Anderson, Robert M May, and B Anderson. Infectious diseases of humans: dynamics and control, volume 28. Wiley Online Library, 1992.
3. Nino Antulov-Fantulin, Alen Lancic, Hrvoje Stefancic, Mile Sikic, and Tomislav Smuc. Statistical inference framework for source detection of contagion processes on arbitrary network structures. arXiv preprint arXiv:1304.0018, 2013.
4. Cesar Henrique Comin and Luciano da Fontoura Costa. Identifying the starting point of a spreading process in complex networks. Physical Review E, 84(5):056105, 2011.
5. Wenxiang Dong, Wenyi Zhang, and Chee Wei Tan. Rooting out the rumor culprit from suspects. arXiv preprint arXiv:1301.6312, 2013.
6. Vincenzo Fioriti and Marta Chinnici. Predicting the sources of an outbreak with a spectral technique. arXiv preprint arXiv:1211.2333, 2012.
7. Linton C Freeman. A set of measures of centrality based on betweenness. Sociometry, pages 35-41, 1977.
8. Michelle Girvan and Mark EJ Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821-7826, 2002.
9. Amit Goyal, Wei Lu, and Laks VS Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th International Conference on Data Mining (ICDM), pages 211-220. IEEE, 2011.
10. Jing Guo, Peng Zhang, Chuan Zhou, Yanan Cao, and Li Guo. Personalized influence maximization on social networks. In Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, pages 199-208. ACM, 2013.
11. David Kempe, Jon Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137-146. ACM, 2003.
12. Masahiro Kimura, Kazumi Saito, and Ryohei Nakano. Extracting influential nodes for information diffusion on a social network. In AAAI, volume 7, pages 1371-1376, 2007.
13. Andrey Y Lokhov, Marc Mezard, Hiroki Ohta, and Lenka Zdeborova. Inferring the origin of an epidemy with dynamic message-passing algorithm. arXiv preprint arXiv:1303.5315, 2013.
14. Mark EJ Newman. Finding community structure in networks using the eigenvectors of matrices. Physical review E, 74(3):036104, 2006.
15. Mark EJ Newman and Michelle Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
16. Pedro C Pinto, Patrick Thiran, and Martin Vetterli. Locating the source of diffusion in large-scale networks. Physical Review Letters, 109(6):068702, 2012.
17. B Aditya Prakash, Jilles Vreeken, and Christos Faloutsos. Spotting culprits in epidemics: How many and which ones? In 2012 IEEE 12th International Conference on Data Mining (ICDM), pages 11-20. IEEE, 2012.
18. John Scott. Social network analysis. Sociology, 22(1):109-127, 1988.
19. Devavrat Shah and Tauhid Zaman. Rumors in a network: Who's the culprit? Information Theory, IEEE Transactions on, 57(8):5163-5181, 2011.
20. Devavrat Shah and Tauhid Zaman. Rumor centrality: A universal source detector. 40(1):199-210, 2012.
21. Hanghang Tong, B Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. On the vulnerability of large graphs. In 2010 IEEE 10th International Conference on Data Mining (ICDM), pages 1091-1096. IEEE, 2010.
22. Erik Volz and Lauren Ancel Meyers. Susceptible-infected-recovered epidemics in dynamic contact networks. Proceedings of the Royal Society B: Biological Sciences, 274(1628):2925-2934, 2007.
23. Chuan Zhou, Peng Zhang, Jing Guo, Xingquan Zhu, and Li Guo. Ublf: An upper bound based approach to discover influential nodes in social networks. In IEEE 13th International Conference on Data Mining (ICDM), pages 907-916. IEEE, 2013.
24. Kai Zhu and Lei Ying. Information source detection in the sir model: A sample path based approach. In Information Theory and Applications Workshop (ITA), 2013, pages 1-9. IEEE, 2013.