Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A universal optimization framework based on cycle ranking for influence maximization in complex networks (2405.09357v1)

Published 15 May 2024 in cs.SI and physics.soc-ph

Abstract: Influence maximization aims to identify a set of influential individuals, referred to as influencers, as information sources to maximize the spread of information within networks, constituting a vital combinatorial optimization problem with extensive practical applications and sustained interdisciplinary interest. Diverse approaches have been devised to efficiently address this issue, one of which involves selecting the influencers from a given centrality ranking. In this paper, we propose a novel optimization framework based on ranking basic cycles in networks, capable of selecting the influencers from diverse centrality measures. The experimental results demonstrate that, compared to directly selecting the top-k nodes from centrality sequences and other state-of-the-art optimization approaches, the new framework can expand the dissemination range by 1.5 to 3 times. Counterintuitively, it exhibits minimal hub property, with the average distance between influencers being only one-third of alternative approaches, regardless of the centrality metrics or network types. Our study not only paves the way for novel strategies in influence maximization but also underscores the unique potential of underappreciated cycle structures.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (67)
  1. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146, 2003.
  2. Generalized network dismantling. Proceedings of the national academy of sciences, 116(14):6554–6559, 2019.
  3. Immunization and targeted destruction of networks using explosive percolation. Physical review letters, 117(20):208301, 2016.
  4. Containing epidemic outbreaks by message-passing techniques. Physical Review X, 4(2):021024, 2014.
  5. Influence maximization in complex networks through optimal percolation. Nature, 524(7563):65–68, 2015.
  6. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 420–429, 2007.
  7. A data-based approach to social influence maximization. 5(1):73–84, 2011.
  8. 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, pages 1029–1038, 2010.
  9. Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 946–957. SIAM, 2014.
  10. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 199–208, 2009.
  11. Vital nodes identification in complex networks. Physics Reports, 650:1–63, 2016.
  12. Cofim: A community-based framework for influence maximization on large-scale networks. Knowledge-Based Systems, 117:88–100, 2017.
  13. Community-diversified influence maximization in social networks. Information Systems, 92:101522, 2020.
  14. Detecting global bridges in networks. Journal of Complex Networks, 4(3):319–329, 2016.
  15. Network dismantling. Proceedings of the National Academy of Sciences, 113(44):12368–12373, 2016.
  16. Optimizing spread dynamics on graphs by message passing. Journal of Statistical Mechanics: Theory and Experiment, 2013(09):P09011, 2013.
  17. Identifying optimal targets of network attack by belief propagation. Physical Review E, 94(1):012305, 2016.
  18. Fundamental difference between superblockers and superspreaders in networks. Physical Review E, 95(1):012318, 2017.
  19. Effective spreading from multiple leaders identified by percolation in the susceptible-infected-recovered (sir) model. New Journal of Physics, 19(7):073020, 2017.
  20. Inverse targeting—an effective immunization strategy. Europhysics Letters, 98(4):46002, 2012.
  21. On the influence maximization problem and the percolation phase transition. Physica A: Statistical Mechanics and its Applications, 573:125928, 2021.
  22. Identifying vital nodes by achlioptas process. New Journal of Physics, 23(3):033036, 2021.
  23. Unveiling explosive vulnerability of networks through edge collective behavior. arXiv preprint arXiv:2310.06407, 2023.
  24. Finding key players in complex networks through deep reinforcement learning. Nature machine intelligence, 2(6):317–324, 2020.
  25. Influence maximization in social networks using graph embedding and graph neural network. Information Sciences, 607:1617–1636, 2022.
  26. Deep graph representation learning and optimization for influence maximization. In International Conference on Machine Learning, pages 21350–21361. PMLR, 2023.
  27. A survey on influence maximization: From an ml-based combinatorial optimization. ACM Transactions on Knowledge Discovery from Data, 17(9):1–50, 2023.
  28. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 30(10):1852–1872, 2018.
  29. A survey on influence maximization in a social network. Knowledge and Information Systems, 62:3417–3455, 2020.
  30. Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study. Journal of King Saud University-Computer and Information Sciences, 34(9):7570–7603, 2022.
  31. Cost effective approach to identify multiple influential spreaders based on the cycle structure in networks. Science China Information Sciences, 66(9):192203, 2023.
  32. Leaders in social networks, the delicious case. PloS One, 6(6):e21202, 2011.
  33. Characterizing cycle structure in complex networks. Communications Physics, 4(1):1–9, 2021.
  34. A novel top-k strategy for influence maximization in complex networks with community structure. PloS one, 10(12):e0145283, 2015.
  35. Identification of influential spreaders in complex networks. Nature Physics, 6(11):888–893, 2010.
  36. A research of a strategy to balance the importance and dispersion of multiple critical nodes. Europhysics Letters, 144(4):41002, 2023.
  37. Identifying multiple influential spreaders in complex networks by considering the dispersion of nodes. Frontiers in Physics, 9:766615, 2022.
  38. Effects of the distance among multiple spreaders on the spreading. Europhysics Letters, 106(1):18002, 2014.
  39. Wenfeng Shi. Research on node importance ranking and influence maximization based on the network cycle structure. Master’s thesis, University of Electronic Science and Technology of China, 2023.
  40. Number of loops of size h in growing scale-free networks. Physical review letters, 90(7):078701, 2003.
  41. Information storage, loop motifs, and clustered structure in complex networks. Physical Review E, 86(2):026110, 2012.
  42. Defining and identifying communities in networks. Proceedings of the national academy of sciences, 101(9):2658–2663, 2004.
  43. Stability in real food webs: weak links in long loops. Science, 296(5570):1120–1123, 2002.
  44. Cliques and cavities in the human connectome. Journal of computational neuroscience, 44:115–145, 2018.
  45. Hai-Jun Zhou. Spin glass approach to the feedback vertex set problem. The European Physical Journal B, 86:1–9, 2013.
  46. Towards the cycle structures in complex network: A new perspective. arXiv preprint arXiv:1903.01397, 2019.
  47. Searching for key cycles in a complex network. Physical Review Letters, 130(18):187402, 2023.
  48. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008.
  49. Centrality measures based on current flow. In Annual symposium on theoretical aspects of computer science, pages 533–544. Springer, 2005.
  50. Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163–177, 2001.
  51. Mark EJ Newman. A measure of betweenness centrality based on random walks. Social networks, 27(1):39–54, 2005.
  52. Paul Jaccard. The distribution of the flora in the alpine zone. New phytologist, 11(2):37–50, 1912.
  53. Mark Newman. Networks. Oxford university press, 2018.
  54. The h-index of a network node and its relation to degree and coreness. Nature Communications, 7(1):1–7, 2016.
  55. Identifying influential nodes in complex networks. Physica a: Statistical mechanics and its applications, 391(4):1777–1787, 2012.
  56. Collective influence algorithm to find influencers via optimal percolation in massively large social media. Scientific Reports, 6(1):1–11, 2016.
  57. Phillip Bonacich. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1):113–120, 1972.
  58. Linton C Freeman. Centrality in social networks conceptual clarification. Social Networks, 1(3):215–239, 1978.
  59. Epidemic processes in complex networks. Reviews of modern physics, 87(3):925, 2015.
  60. Collective dynamics of ‘small-world’ networks. Nature, 393(6684):440–442, 1998.
  61. Self-similar community structure in a network of human interactions. Physical review E, 68(6):065103, 2003.
  62. Vladimir Batagelj Andrej Mrvar. Network data repository. https://networkrepository.com/.
  63. Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pages 1325–1334, 2020.
  64. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
  65. On the evolution of random graphs. Publ. math. inst. hung. acad. sci, 5(1):17–60, 1960.
  66. Mark EJ Newman. Clustering and preferential attachment in growing networks. Physical Review E, 64(2):025102, 2001.
  67. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Wenfeng Shi (2 papers)
  2. Tianlong Fan (12 papers)
  3. Shuqi Xu (11 papers)
  4. Rongmei Yang (5 papers)
  5. Linyuan Lü (68 papers)

Summary

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

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