Information Source Detection in the SIR Model: A Sample-Path-Based Approach

IEEE/ACM Transactions on Networking

Volumn 24, Issue 1, 2016, Pages 408-421

  Zhu, Kai ^a   Ying, Lei ^a  

^a Arizona State University   (United States)

Author keywords

Information source detection; sample path based approach; Susceptible Infected Recovered (SIR) model

Indexed keywords

COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; FORESTRY; RECOVERY; TREES (MATHEMATICS);

CLOSENESS CENTRALITIES; HIGH PROBABILITY; INFECTION ALGORITHMS; INFORMATION SOURCES; NETWORK TOPOLOGY; REAL-WORLD NETWORKS; SPREAD OF INFORMATIONS; SUSCEPTIBLE-INFECTED-RECOVERED MODEL;

TOPOLOGY;

EID: 84911432372     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2014.2364972     Document Type: Article

References (20)

1. C. Moore and M. E. J. Newman, "Epidemics and percolation in smallworld networks," Phys. Rev. E, vol. 61, no. 5, pp. 5678-5682, 2000.
2. A. Ganesh, L. Massoulie, and D. Towsley, "The effect of network topology on the spread of epidemics," in Proc. IEEE INFOCOM, Miami, FL, USA, Mar. 2005, pp. 1455-1466.
3. D. Shah and T. Zaman, "Detecting sources of computer viruses in networks: Theory and experiment," in Proc. ACM SIGMETRICS, New York, NY, USA, 2010, pp. 203-214.
4. D. Shah and T. Zaman, "Rumors in a network: Who's the culprit?," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5163-5181, Aug. 2011.
5. D. Shah and T. Zaman, "Rumor centrality: A universal source detector," in Proc. ACM SIGMETRICS, London, U.K., 2012, pp. 199-210.
6. N. T. J. Bailey, The Mathematical Theory of Infectious Diseases and Its Applications. New York, NY, USA: Hafner, 1975.
7. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge, U.K.: Cambridge Univ. Press, 2010.
8. M. E. J. Newman, "The spread of epidemic disease on networks," Phys. Rev. E, vol. 66, no. 1, p. 016128, Jul. 2002.
9. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scalefree networks," Phys. Rev. Lett., vol. 86, no. 14, pp. 3200-3203, 2001.
10. W. Luo and W. P. Tay, "Identifying multiple infection sources in a network," in Proc. Asilomar Conf. Signals, Syst. Comput., 2012, pp. 1483-1489.
11. W. Luo, W. P. Tay, and M. Leng, "Identifying infection sources and regions in large networks," IEEE Trans. Signal Process., vol. 61, no. 11, pp. 2850-2865, Jun. 2013.
12. B. A. Prakash, J. Vreeken, and C. Faloutsos, "Spotting culprits in epidemics: How many and which ones?," in Proc. IEEE ICDM, Brussels, Belgium, 2012, pp. 11-20.
13. V. G. Subramanian and R. Berry, "Spotting trendsetters: Inference for network games," in Proc. Annu. Allerton Conf. Commun., Control, Comput., 2012, pp. 1697-1704.
14. C. Milling, C. Caramanis, S. Mannor, and S. Shakkottai, "Network forensics: Random infection vs spreading epidemic," in Proc. ACM SIGMETRICS, 2012, pp. 223-234.
15. P. Shakarian, V. S. Subrahmanian, and M. L. Sapino, "GAPs: Geospatial abduction problems," Trans. Intell. Syst. Technol., vol. 3, no. 1, pp. 1-27, Oct. 2011.
16. P. Shakarian and V. S. Subrahmanian, Geospatial Abduction: Principles and Practice. New York, NY, USA: Springer, 2011.
17. F. Harary, Graph Theory. Reading, MA, USA: Addison-Wesley, 1991.
18. D. Koschutzki et al., "Centrality indices," in Network Analysis, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer, 2005, vol. 3418, pp. 16-61.
19. P. Haccou, P. Jagers, and V. A. Vatutin, Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge, U.K.: Cambridge Univ. Press, 2005.
20. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.