Fast and accurate detection of spread source in large complex networks

Spread over complex networks is a ubiquitous process with increasingly wide applications. Locating spread sources is often important, e.g. finding the patient one in epidemics, or source of rumor spreading in social network. Pinto, Thiran and Vetterli introduced an algorithm (PTVA) to solve the important case of this problem in which a limited set of nodes act as observers and report times at which the spread reached them. PTVA uses all observers to find a solution. Here we propose a new approach in which observers with low quality information (i.e. with large spread encounter times) are ignored and potential sources are selected based on the likelihood gradient from high quality observers. The original complexity of PTVA is O(Nα), where α ∈ (3,4) depends on the network topology and number of observers (N denotes the number of nodes in the network). Our Gradient Maximum Likelihood Algorithm (GMLA) reduces this complexity to O (N2log (N)). Extensive numerical tests performed on synthetic networks and real Gnutella network with limitation that id’s of spreaders are unknown to observers demonstrate that for scale-free networks with such limitation GMLA yields higher quality localization results than PTVA does.

[1]  Wuqiong Luo,et al.  How to Identify an Infection Source With Limited Observations , 2013, IEEE Journal of Selected Topics in Signal Processing.

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

[3]  Oscar Cordón,et al.  An agent-based model for understanding the influence of the 11-M terrorist attacks on the 2004 Spanish elections , 2017, Knowl. Based Syst..

[4]  Massimo Franceschetti,et al.  Rumor source detection under probabilistic sampling , 2013, 2013 IEEE International Symposium on Information Theory.

[5]  Johan van Leeuwaarden,et al.  Epidemic spreading on complex networks with community structures , 2016, Scientific Reports.

[6]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[7]  Alexander Grey,et al.  The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .

[8]  Albert-László Barabási,et al.  Linked - how everything is connected to everything else and what it means for business, science, and everyday life , 2003 .

[9]  Dirk Helbing,et al.  From social data mining to forecasting socio-economic crises , 2010, The European physical journal. Special topics.

[10]  Mile Šikić,et al.  Identification of Patient Zero in Static and Temporal Networks: Robustness and Limitations. , 2015, Physical review letters.

[11]  Alessandro Ingrosso,et al.  Inference of causality in epidemics on temporal contact networks , 2016, Scientific Reports.

[12]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[13]  Jianwei Wang,et al.  Abnormal cascading failure spreading on complex networks , 2016 .

[14]  J. G. Contreras,et al.  Pion, Kaon, and Proton Production in Central Pb-Pb Collisions at √sNN=2.76 TeV , 2012, 1208.1974.

[15]  Jarosław Jankowski,et al.  Balancing Speed and Coverage by Sequential Seeding in Complex Networks , 2016, Scientific Reports.

[16]  Paul Lukowicz,et al.  A planetary nervous system for social mining and collective awareness , 2012, ArXiv.

[17]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[18]  Christos Faloutsos,et al.  Spotting Culprits in Epidemics: How Many and Which Ones? , 2012, 2012 IEEE 12th International Conference on Data Mining.

[19]  Hans J Herrmann,et al.  Spreading gossip in social networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Wanlei Zhou,et al.  Rumor Source Identification in Social Networks with Time-Varying Topology , 2018, IEEE Transactions on Dependable and Secure Computing.

[21]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[22]  Wanlei Zhou,et al.  Identifying Propagation Sources in Networks: State-of-the-Art and Comparative Studies , 2017, IEEE Communications Surveys & Tutorials.

[23]  M. Gentzkow,et al.  Social Media and Fake News in the 2016 Election , 2017 .

[24]  Wen-Xu Wang,et al.  Multi-source localization on complex networks with limited observers , 2016 .

[25]  Caroline Ash.  Superspreaders are local and disproportionate. , 2017, Science.

[26]  N. Ling.  The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[27]  E Banas,et al.  Search for Higgs and Z boson decays to J/ψγ and ϒ(nS)γ with the ATLAS detector , 2015, 1501.03276.

[28]  Huiyan Kang,et al.  Epidemic spreading on adaptively weighted scale-free networks , 2017, Journal of mathematical biology.

[29]  Lenka Zdeborová,et al.  Inferring the origin of an epidemy with dynamic message-passing algorithm , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Boleslaw K. Szymanski,et al.  Threshold-limited spreading in social networks with multiple initiators , 2013, Scientific Reports.

[31]  Vincenzo Fioriti,et al.  Predicting the sources of an outbreak with a spectral technique , 2012, ArXiv.

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

[33]  Peter M. A. Sloot,et al.  Stochastic resonance for information flows on hierarchical networks , 2013, The European Physical Journal Special Topics.

[34]  Wen-Xu Wang,et al.  Locating the source of diffusion in complex networks by time-reversal backward spreading. , 2016, Physical review. E.

[35]  D. Helbing,et al.  The Hidden Geometry of Complex, Network-Driven Contagion Phenomena , 2013, Science.

[36]  Feng Fu,et al.  Dueling biological and social contagions , 2017, Scientific Reports.

[37]  Janusz A. Holyst,et al.  Noise enhances information transfer in hierarchical networks , 2013, Scientific Reports.

[38]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[39]  Ming Tang,et al.  Explosive spreading on complex networks: the role of synergy , 2016, Physical review. E.

[40]  Ralf Eichhorn,et al.  Entropy production of a Brownian ellipsoid in the overdamped limit. , 2015, Physical review. E.

[41]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[42]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[43]  Patrick Thiran,et al.  Observer placement for source localization: The effect of budgets and transmission variance , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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