Rumor source detection under querying with untruthful answers

Social networks are the major routes for most individuals to exchange their opinions about new products, social trends and political issues via their interactions. It is often of significant importance to figure out who initially diffuses the information, i.e., finding a rumor source or a trend setter. It is known that such a task is highly challenging and the source detection probability cannot be beyond 31% for regular trees, if we just estimate the source from a given diffusion snapshot. In practice, finding the source often entails the process of querying that asks “Are you the rumor source?” or “Who tells you the rumor?” that would increase the chance of detecting the source. In this paper, we consider two kinds of querying: (a) simple batch querying and (b) interactive querying with direction under the assumption that queriees can be untruthful with some probability. We propose estimation algorithms for those queries, and quantify their detection performance and the amount of extra budget due to untruthfulness, analytically showing that querying significantly improves the detection performance. We perform extensive simulations to validate our theoretical findings over synthetic and real-world social network topologies.

[1]  Devavrat Shah,et al.  Detecting sources of computer viruses in networks: theory and experiment , 2010, SIGMETRICS '10.

[2]  Devavrat Shah,et al.  Rumors in a Network: Who's the Culprit? , 2009, IEEE Transactions on Information Theory.

[3]  D. Shah,et al.  Finding Rumor Sources on Random Graphs , 2012 .

[4]  Devavrat Shah,et al.  Rumor centrality: a universal source detector , 2012, SIGMETRICS '12.

[5]  Martin Vetterli,et al.  Locating the Source of Diffusion in Large-Scale Networks , 2012, Physical review letters.

[6]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[7]  Chee Wei Tan,et al.  Rooting out the rumor culprit from suspects , 2013, 2013 IEEE International Symposium on Information Theory.

[8]  Wuqiong Luo,et al.  Finding an infection source under the SIS model , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[9]  Alan M. Frieze,et al.  Looking for vertex number one , 2014, ArXiv.

[10]  Chee Wei Tan,et al.  Rumor source detection with multiple observations: fundamental limits and algorithms , 2014, SIGMETRICS '14.

[11]  Lei Ying,et al.  A robust information source estimator with sparse observations , 2013, Computational Social Networks.

[12]  Michael Fuchs,et al.  Rumor source detection for rumor spreading on random increasing trees , 2015 .

[13]  Enhong Chen,et al.  Information Source Detection via Maximum A Posteriori Estimation , 2015, 2015 IEEE International Conference on Data Mining.

[14]  Hongyuan Zha,et al.  Back to the Past: Source Identification in Diffusion Networks from Partially Observed Cascades , 2015, AISTATS.

[15]  Lei Ying,et al.  Information source detection in the SIR model: A sample path based approach , 2012, 2013 Information Theory and Applications Workshop (ITA).

[16]  Jaeyoung Choi,et al.  Estimating the rumor source with anti-rumor in social networks , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[17]  Sangwoo Moon,et al.  Rumor Source Detection: Power of Protector , 2016 .

[18]  Jinwoo Shin,et al.  Rumor Source Detection: Power of Querying , 2016 .

[19]  Lei Ying,et al.  Information source detection in networks: Possibility and impossibility results , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[20]  Luc Devroye,et al.  Finding Adam in random growing trees , 2014, Random Struct. Algorithms.

[21]  Po-Ling Loh,et al.  Confidence Sets for the Source of a Diffusion in Regular Trees , 2015, IEEE Transactions on Network Science and Engineering.