skip to main content
extended-abstract

Generalization of Information Spreading Forensics via Sequential Dependent Snapshots

Published:29 September 2016Publication History
Skip Abstract Section

Abstract

Learning the characteristics of information spreading in networks is crucial in communication studies, social network sentiment analysis and epidemic investigation. Previous work on information spreading has been focused on the information source detection using either a single observation, or multiple but "independent" observations of the underlying network while assuming information spreads at a "uniform spreading rate". In this paper, we conduct the first theoretical and experimental study on information spreading forensics, and propose a framework for estimating information spreading rates, information source start time and location of information source by utilizing "multiple sequential and dependent snapshots" where information can spread at different rates. We prove that our estimation framework generalizes the rumor centrality [1], and we allow heterogeneous information spreading rates on different branches in d-regular tree networks. We further show that our framework can provide highly accurate estimates for the information spreading rates on different branches, the source start time, and more accurate estimate for the location of information source than rumor centrality and Jordan center in both synthetic networks and real-world networks (i.e., Twitter).

References

  1. D. Shah and T. Zaman. Detecting sources of computer viruses in networks: theory and experiment. In Proc. of ACM SIGMETRICS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. De Choudhury, Y.-R. Lin, H. Sundaram, K. S. Candan, L. Xie, and A. Kelliher. How does the data sampling strategy impact the discovery of information diffusion in social media? ICWSM, 10:34--41, 2010.Google ScholarGoogle Scholar
  3. M. Laskowski, L. C. Mostaço-Guidolin, A. L. Greer, J. Wu, and S. M. Moghadas. The impact of demographic variables on disease spread: influenza in remote communities. Scientific Reports, 1, 2011.Google ScholarGoogle Scholar
  4. B. Doerr, M. Fouz, and T. Friedrich. Why rumors spread so quickly in social networks. Communications of the ACM, 55(6):70--75, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Z. Wang, W. Dong, W. Zhang, and C. W. Tan. Rumor source detection with multiple observations: Fundamental limits and algorithms. In Proc. of ACM SIGMETRICS, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. K. Zhu and L. Ying. Information source detection in the sir model: A sample-path-based approach. Networking, IEEE/ACM Transactions on, PP(99):1--1, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning influence nprobabilities in social networks. In Proc. of the ACM WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Weng. Prediction of viral memes on twitter. http://carl.cs.indiana.edu/data/.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 44, Issue 2
    September 2016
    98 pages
    ISSN:0163-5999
    DOI:10.1145/3003977
    • Editor:
    • Nidhi Hegde
    Issue’s Table of Contents

    Copyright © 2016 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 29 September 2016

    Check for updates

    Qualifiers

    • extended-abstract

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader