Document Open Access Logo

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs

Authors Kengo Nakamura , Masaaki Nishino

PDF

File

Thumbnail PDF
PDF
LIPIcs.SWAT.2026.34.pdf
  • Filesize: 1.05 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Networks → Network algorithms
Keywords
  • Influence spread
  • bounded pathwidth
  • network reliability
  • linear time algorithm

Metrics

Abstract

Given a network and a set of vertices called seeds to initially inject information, influence spread is the expected number of vertices that eventually receive the information under a certain stochastic model of information propagation. Under the commonly used independent cascade model, influence spread is equivalent to the expected number of vertices reachable from the seeds on a directed uncertain graph, and the exact evaluation of influence spread offers many applications, e.g., influence maximization. Although its evaluation is a #P-hard task, there is an algorithm that can precisely compute the influence spread in O(mnω_p²⋅ 2^{ω_p²}) time, where ω_p is the pathwidth of the graph. We improve this by developing an algorithm that computes the influence spread in O((m+n)ω_p²⋅ 2^{ω_p²}) time. This is achieved by identifying the similarities in the repetitive computations in the existing algorithm and sharing them to reduce computation. Although similar refinements have been considered for the probability computation on undirected uncertain graphs, a greater number of similarities must be leveraged for directed graphs to achieve linear time complexity.

Cite As Get BibTex

Kengo Nakamura and Masaaki Nishino. Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs. In 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 370, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SWAT.2026.34

Author Details

Kengo Nakamura
  • Communication Science Laboratories, NTT, Inc., Kyoto, Japan
Masaaki Nishino
  • Communication Science Laboratories, NTT, Inc., Kyoto, Japan

Funding

This work was supported by JSPS KAKENHI Grant Number JP26K02906.

References

  1. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. A circuit-based approach to efficient enumeration. In Proc. of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pages 111:1-111:15, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.111.
  2. Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, 1996. URL: https://doi.org/10.1137/S0097539793251219.
  3. Wei Chen, Chi Wang, and Yajun Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proc. of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pages 1029-1038, 2010. URL: https://doi.org/10.1145/1835804.1835934.
  4. Wei Chen, Yajun Wang, and Siyu Yang. Efficient influence maximization in social networks. In Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009), pages 199-208, 2009. URL: https://doi.org/10.1145/1557019.1557047.
  5. Pedro Domingos and Matt Richardson. Mining the network value of customers. In Proc. of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), pages 57-66, 2001. URL: https://doi.org/10.1145/502512.502525.
  6. Jacob Goldenberg, Barak Libai, and Eitan Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 12:211-223, 2001. URL: https://doi.org/10.1023/A:1011122126881.
  7. Amit Goyal, Wei Lu, and Laks V.S. Lakshmanan. CELF++: optimizing the greedy algorithm for influence maximization in social networks. In Proc. of the 20th International Conference Companion on World Wide Web (WWW 2011), pages 47-48, 2011. URL: https://doi.org/10.1145/1963192.1963217.
  8. Gary Hardy, Corinne Lucet, and Nikolaos Limnios. K-terminal network reliability measures with binary decision diagrams. IEEE Transactions on Reliability, 56(3):506-515, 2007. URL: https://doi.org/10.1109/TR.2007.898572.
  9. Yuma Inoue and Shin-ichi Minato. Acceleration of ZDD construction for subgraph enumeration via pathwidth optimization. Technical Report TCS-TR-A-16-80, Division of Computer Science, Hokkaido University, 2016. Google Scholar
  10. David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pages 137-146, 2003. URL: https://doi.org/10.1145/956750.956769.
  11. Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. Cost-effective outbreak detection in networks. In Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), pages 420-429, 2007. URL: https://doi.org/10.1145/1281192.1281239.
  12. Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 30(10):1852-1872, 2018. URL: https://doi.org/10.1109/TKDE.2018.2807843.
  13. Yuchen Li, Dongxiang Zhang, and Kian-Lee Tan. Real-time targeted influence maximization for online advertisements. Proc. of the VLDB Endowment, pages 1070-1081, 2015. URL: https://doi.org/10.14778/2794367.2794376.
  14. Chen Ling, Junji Jiang, Junxiang Wang, My T. Thai, Renhao Xue, James Song, Meikang Qiu, and Liang Zhao. Deep graph representation learning and optimization for influence maximization. In Proc. of the 40th International Conference on Machine Learning (ICML 2023), volume 202 of Proceedings of Machine Learning Research, pages 21350-21361, 2023. URL: https://proceedings.mlr.press/v202/ling23b.html.
  15. Takanori Maehara, Hirofumi Suzuki, and Masakazu Ishihata. Exact computation of influence spread by binary decision diagrams. In Proc. of the 26th International Conference on World Wide Web (WWW 2017), pages 947-956, 2017. URL: https://doi.org/10.1145/3038912.3052567.
  16. Kengo Nakamura, Takeru Inoue, Masaaki Nishino, and Norihito Yasuda. Efficient network reliability evaluation for client-server model. In Proc. of the 2021 IEEE Global Communications Conference (GLOBECOM 2021), pages 1-6, 2021. URL: https://doi.org/10.1109/GLOBECOM46510.2021.9685283.
  17. Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, and Shin-ichi Minato. A fast and exact evaluation algorithm for the expected number of connected nodes: an enhanced network reliability measure. In Proc. of the 2023 IEEE International Conference on Computer Communications (INFOCOM 2023), pages 1-10, 2023. URL: https://doi.org/10.1109/INFOCOM53939.2023.10228897.
  18. Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-ichi Kawarabayashi. Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In Proc. of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 138-144, 2014. URL: https://doi.org/10.1609/aaai.v28i1.8726.
  19. Shashank Sheshar Singh, Divya Srivastva, Madhushi Verma, and Jagendra Singh. 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. URL: https://doi.org/10.1016/j.jksuci.2021.08.009.
  20. Hirofumi Suzuki, Masakazu Ishihata, and Shin-ichi Minato. Exact computation of strongly connected reliability by binary decision diagrams. In Proc. of the 12th International Conference on Combinatorial Optimization and Applications (COCOA 2018), pages 281-295, 2018. URL: https://doi.org/10.1007/978-3-030-04651-4_19.
  21. Robert Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972. URL: https://doi.org/10.1137/0201010.
  22. Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979. URL: https://doi.org/10.1137/0208032.
  23. Peng Wu and Li Pan. Scalable influence blocking maximization in social networks under competitive independent cascade models. Computer Networks, 123:38-50, 2017. URL: https://doi.org/10.1016/j.comnet.2017.05.004.
  24. Mao Ye, Xingjie Liu, and Wang-Chien Lee. Exploring social influence for recommendation: a generative model approach. In Proc. of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2012), pages 671-680, 2012. URL: https://doi.org/10.1145/2348283.2348373.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact