Papers
Topics
Authors
Recent
Search
2000 character limit reached

Source Detection in Networks using the Stationary Distribution of a Markov Chain

Published 20 Jan 2024 in cs.SI | (2401.11330v1)

Abstract: Nowadays, the diffusion of information through social networks is a powerful phenomenon. One common way to model diffusions in social networks is the Independent Cascade (IC) model. Given a set of infected nodes according to the IC model, a natural problem is the source detection problem, in which the goal is to identify the unique node that has started the diffusion. Maximum Likelihood Estimation (MLE) is a common approach for tackling the source detection problem, but it is computationally hard. In this work, we propose an efficient method for the source detection problem under the MLE approach, which is based on computing the stationary distribution of a Markov chain. Using simulations, we demonstrate the effectiveness of our method compared to other state-of-the-art methods from the literature, both on random and real-world networks.

Authors (3)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. A fast monte carlo algorithm for source localization on graphs. In Wavelets and Sparsity XV (2013), vol. 8858, SPIE, pp. 429–434.
  2. Contrasting the spread of misinformation in online social networks. Journal of Artificial Intelligence Research 69 (2020), 847–879.
  3. Batabyal, A. A. Markov chains: Models, algorithms and applications. Interfaces 36, 6 (2006), 609.
  4. Finding all spanning trees of directed and undirected graphs. SIAM Journal on Computing 7, 3 (1978), 280–287.
  5. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12, 3 (2001), 211–223.
  6. Inferring networks of diffusion and influence. ACM Transactions on Knowledge Discovery from Data (TKDD) 5, 4 (2012), 1–37.
  7. Identifying propagation sources in networks: State-of-the-art and comparative studies. IEEE Communications Surveys & Tutorials 19, 1 (2016), 465–481.
  8. Schemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of research. Discrete Mathematics, Algorithms and Applications (2021), 2130002.
  9. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003), ACM, pp. 137–146.
  10. Ct-ic: Continuously activated and time-restricted independent cascade model for viral marketing. Knowledge-Based Systems 62 (2014), 57–68.
  11. Temporally agnostic rumor-source detection. IEEE Transactions on Signal and Information Processing over Networks 3, 2 (2017), 316–329.
  12. Finding effectors in social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (2010), pp. 1059–1068.
  13. Estimating a probability using finite memory. IEEE Transactions on Information Theory 32, 6 (1986), 733–742.
  14. Markov chains and mixing times, vol. 107. American Mathematical Soc., 2017.
  15. Myung, I. J. Tutorial on maximum likelihood estimation. Journal of mathematical Psychology 47, 1 (2003), 90–100.
  16. Detecting sources of computer viruses in networks: theory and experiment. In Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2010), pp. 203–214.
  17. Rumors in a network: Who’s the culprit? IEEE Transactions on information theory 57, 8 (2011), 5163–5181.
  18. Sharir, M. A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications 7, 1 (1981), 67–72.
  19. Source detection of rumor in social network–a review. Online Social Networks and Media 9 (2019), 30–42.
  20. Effector detection in social networks. IEEE Transactions on Computational Social Systems 3, 4 (2016), 151–163.
  21. Multiple source detection without knowing the underlying propagation model. In Proceedings of the AAAI Conference on Artificial Intelligence (2017), vol. 31.
  22. Cascade source inference in networks: a markov chain monte carlo approach. Computational social networks 2, 1 (2015), 1–17.
  23. A markov chain monte carlo approach for source detection in networks. In Chinese National Conference on Social Media Processing (2017), Springer, pp. 77–88.
  24. Catch’em all: Locating multiple diffusion sources in networks with partial observations. In Proceedings of the AAAI Conference on Artificial Intelligence (2017), vol. 31.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up