Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
36 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
37 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
4 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Link Recommendation to Augment Influence Diffusion with Provable Guarantees (2402.19189v1)

Published 29 Feb 2024 in cs.SI

Abstract: Link recommendation systems in online social networks (OSNs), such as Facebook's People You May Know'', Twitter'sWho to Follow'', and Instagram's ``Suggested Accounts'', facilitate the formation of new connections among users. This paper addresses the challenge of link recommendation for the purpose of social influence maximization. In particular, given a graph $G$ and the seed set $S$, our objective is to select $k$ edges that connect seed nodes and ordinary nodes to optimize the influence dissemination of the seed set. This problem, referred to as influence maximization with augmentation (IMA), has been proven to be NP-hard. In this paper, we propose an algorithm, namely \textsf{AIS}, consisting of an efficient estimator for augmented influence estimation and an accelerated sampling approach. \textsf{AIS} provides a $(1-1/\mathrm{e}-\varepsilon)$-approximate solution with a high probability of $1-\delta$, and runs in $O(k2 (m+n) \log (n / \delta) / \varepsilon2 + k \left|E_{\mathcal{C}}\right|)$ time assuming that the influence of any singleton node is smaller than that of the seed set. To the best of our knowledge, this is the first algorithm that can be implemented on large graphs containing millions of nodes while preserving strong theoretical guarantees. We conduct extensive experiments to demonstrate the effectiveness and efficiency of our proposed algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. Minimizing Hitting Time between Disparate Groups with Shortcut Edges. arXiv preprint arXiv:2306.03571 (2023).
  2. Competitive influence maximization in social networks. In International workshop on web and internet economics. Springer, 306–311.
  3. Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 946–957.
  4. Recommendations to boost content spread in social networks. In Proceedings of the 21st international conference on World Wide Web. 529–538.
  5. Information and Influence Propagation in Social Networks. Morgan & Claypool Publishers.
  6. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. 1029–1038.
  7. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 199–208.
  8. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE international conference on data mining. IEEE, 88–97.
  9. Link recommendation for social influence maximization. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 6 (2021), 1–23.
  10. Recommending links through influence maximization. Theoretical Computer Science 764 (2019), 30–41.
  11. Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 57–66.
  12. Celf++ optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th international conference companion on World wide web. 47–48.
  13. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th international conference on data mining. IEEE, 211–220.
  14. Information diffusion in online social networks: A survey. ACM Sigmod Record 42, 2 (2013), 17–28.
  15. Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems (TODS) 47, 3 (2022), 1–45.
  16. Repbublik: Reducing polarized bubble radius with link insertions. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 139–147.
  17. Revisiting the stop-and-stare algorithms for influence maximization. Proceedings of the VLDB Endowment 10, 9 (2017), 913–924.
  18. Influence maximization in real-world closed social networks. Proceedings of the VLDB Endowment 16, 2 (2022), 180–192.
  19. Irie: Scalable and robust influence maximization in social networks. In 2012 IEEE 12th international conference on data mining. IEEE, 918–923.
  20. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 137–146.
  21. Influential nodes in a diffusion model for social networks. In Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings 32. Springer, 1127–1138.
  22. Scalable diffusion-aware optimization of network topology. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 1226–1235.
  23. Blocking simple and complex contagion by edge removal. In 2013 IEEE 13th international conference on data mining. IEEE, 399–408.
  24. What is Twitter, a social network or a news media?. In WWW ’10: Proceedings of the 19th international conference on World wide web (Raleigh, North Carolina, USA). ACM, New York, NY, USA, 591–600. https://doi.org/10.1145/1772690.1772751
  25. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 420–429.
  26. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.
  27. David Liben-Nowell and Jon Kleinberg. 2003. The link prediction problem for social networks. In Proceedings of the twelfth international conference on Information and knowledge management. 556–559.
  28. Nicholas Metropolis and Stanislaw Ulam. 1949. The monte carlo method. Journal of the American statistical association 44, 247 (1949), 335–341.
  29. An analysis of approximations for maximizing submodular set functions—I. Mathematical programming 14 (1978), 265–294.
  30. Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 28.
  31. Grant Schoenebeck and Biaoshuai Tao. 2020. Influence maximization on undirected graphs: Toward closing the (1-1/e) gap. ACM Transactions on Economics and Computation (TEAC) 8, 4 (2020), 1–36.
  32. Scalable Adversarial Attack Algorithms on Influence Maximization. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining. 760–768.
  33. Online processing algorithms for influence maximization. In Proceedings of the 2018 International Conference on Management of Data. 991–1005.
  34. Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD international conference on management of data. 1539–1554.
  35. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 75–86.
  36. Link Recommendations for PageRank Fairness. In Proceedings of the ACM Web Conference 2022. 3541–3551.
  37. Boosting node activity by recommendations in social networks. Journal of Combinatorial Optimization 40, 3 (2020), 825–847.
  38. Marginal gains to maximize content spread in social networks. IEEE Transactions on Computational Social Systems 6, 3 (2019), 479–490.
  39. Minimizing polarization and disagreement in social networks via link recommendation. Advances in Neural Information Processing Systems 34 (2021), 2072–2084.
  40. 2-hop+ sampling: Efficient and effective influence estimation. IEEE Transactions on Knowledge and Data Engineering (2021).
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now