IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v31y2023i1d10.1007_s10100-022-00807-3.html
   My bibliography  Save this article

An exact method for influence maximization based on deterministic linear threshold model

Author

Listed:
  • Eszter Julianna Csókás

    (University of Szeged)

  • Tamás Vinkó

    (University of Szeged)

Abstract

Influence maximization (IM) is a challenging combinatorial optimization problem on (social) networks given a diffusion model and limited choice for initial seed nodes. In a recent paper by Keskin and Güler (Turkish J of Electrical Eng & Comput Sci 26:3383–3396, 2018) an integer programming formalization of IM using the so-called deterministic linear threshold diffusion model was proposed. In fact, it is a special 0-1 linear program in which the objective is to maximize influence while minimizing the diffusion time. In this paper, by rigorous analysis, we show that the proposed algorithm can get stuck in locally optimal solution or cannot even start on certain input graphs. The identified problems are resolved by introducing further constraints which then leads to a correct algorithmic solution. Benchmarking results are shown to demonstrate the efficiency of the proposed method.

Suggested Citation

  • Eszter Julianna Csókás & Tamás Vinkó, 2023. "An exact method for influence maximization based on deterministic linear threshold model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(1), pages 269-286, March.
    • Handle: RePEc:spr:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00807-3
    DOI: 10.1007/s10100-022-00807-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-022-00807-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-022-00807-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hao-Hsiang Wu & Simge Küçükyavuz, 2018. "A two-stage stochastic programming approach for influence maximization in social networks," Computational Optimization and Applications, Springer, vol. 69(3), pages 563-595, April.
    2. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.
    3. Kahr, Michael & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Benders decomposition for competitive influence maximization in (social) networks," Omega, Elsevier, vol. 100(C).
    4. Zaixin Lu & Wei Zhang & Weili Wu & Joonmo Kim & Bin Fu, 2012. "The complexity of influence maximization problem in the deterministic linear threshold model," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 374-378, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    2. Xiaodong Liu & Xiangke Liao & Shanshan Li & Si Zheng & Bin Lin & Jingying Zhang & Lisong Shao & Chenlin Huang & Liquan Xiao, 2017. "On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks," Complexity, Hindawi, vol. 2017, pages 1-14, September.
    3. Saridakis, Charalampos & Katsikeas, Constantine S. & Angelidou, Sofia & Oikonomidou, Maria & Pratikakis, Polyvios, 2023. "Mining Twitter lists to extract brand-related associative information for celebrity endorsement," European Journal of Operational Research, Elsevier, vol. 311(1), pages 316-332.
    4. Cheng-Lung Chen & Eduardo L. Pasiliao & Vladimir Boginski, 2023. "A polyhedral approach to least cost influence maximization in social networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-31, January.
    5. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.
    6. Xiao, Yunpeng & Wang, Zheng & Li, Qian & Li, Tun, 2019. "Dynamic model of information diffusion based on multidimensional complex network space and social game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 578-590.
    7. S. Raghavan & Rui Zhang, 2022. "Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1345-1365, May.
    8. Kahr, Michael, 2022. "Determining locations and layouts for parcel lockers to support supply chain viability at the last mile," Omega, Elsevier, vol. 113(C).
    9. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).
    10. Kahr, Michael & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Benders decomposition for competitive influence maximization in (social) networks," Omega, Elsevier, vol. 100(C).
    11. Hemant Gehlot & Shreyas Sundaram & Satish V. Ukkusuri, 2023. "Algorithms for influence maximization in socio-physical networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-28, January.
    12. Tavasoli, Ali & Fazli, Mehrdad & Ardjmand, Ehsan & Young, William A. & Shakeri, Heman, 2023. "Competitive pricing under local network effects," European Journal of Operational Research, Elsevier, vol. 311(2), pages 545-566.
    13. Tanınmış, Kübra & Aras, Necati & Altınel, I.K., 2019. "Influence maximization with deactivation in social networks," European Journal of Operational Research, Elsevier, vol. 278(1), pages 105-119.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00807-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.