Skip to main content

Advertisement

Springer Nature Link
Log in

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

  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Acemoglu D, Ozdaglar A, Yildiz E (2011) Diffusion of innovations in social networks. In: 50th IEEE Conference on Decision and Control and European Control Conference pp 2329–2334

  • Altarelli F, Braunstein A, Dall’Asta L, Zecchina R (2013) Optimizing spread dynamics on graphs by message passing. J of Stat Mechanics: Theory and Exp 2013:P09011

    Article  Google Scholar 

  • Chen C-L, Pasiliao EL, Boginski V (2020) A cutting plane method for least cost influence maximization. In: Chellappan S, Choo K-KR, Phan N (eds) Computational data and social networks. Springer International Publishing, Cham, pp 499–511

    Chapter  Google Scholar 

  • Cheng C-H, Kuo Y-H, Zhou Z (2020) Outbreak minimization vs influence maximization: An optimization framework. BMC Medical Informatics and Decision Making 20(1):1–13

    Article  Google Scholar 

  • Farzaneh G-B, Masoud A, Heshaam F (2021) MLPR: Efficient influence maximization in linear threshold propagation model using linear programming. Social Network Analysis and Mining 11:1–10

    Google Scholar 

  • Fourer R, Gay D, Kernighan B (1993) AMPL. a modeling language for mathematical programming. Thomson

  • Goldenberg J, Libai B, Muller E (2001) Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12(3):211–223

    Article  Google Scholar 

  • Granovetter M (1978) Threshold models of collective behavior. Am J of Soc 83(6):1420–1443

    Article  Google Scholar 

  • Güney E (2019) An efficient linear programming based method for the influence maximization problem in social networks. Information Sci 503:589–605

    Article  Google Scholar 

  • Güney E, Leitner M, Ruthmair M, Sinnl M (2021) Large-scale influence maximization via maximal covering location. European J of Oper Res 289(1):144–164

    Article  Google Scholar 

  • Gursoy F, Gunnec D (2018) Influence maximization in social networks under deterministic linear threshold model. Knowledge-Based Syst 161:111–123

    Article  Google Scholar 

  • Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J on Scientific and Stat Comput 13(5):1194–1217

    Article  Google Scholar 

  • Kahr M, Leitner M, Ruthmair M, Sinnl M (2021) Benders decomposition for competitive influence maximization in (social) networks. Omega 100:102264

    Article  Google Scholar 

  • Karampourniotis P, Szymanski B, Korniss G (2019) Influence maximization for fixed heterogeneous thresholds. Scientific Reports 9:5573

    Article  Google Scholar 

  • Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth acm sigkdd international conference on knowledge discovery and data mining pp 137–146

  • Keskin M, Güler M (2018) Influence maximization in social networks: an integer programming approach. Turkish J of Electrical Eng & Comput Sci 26(6):3383–3396

    Google Scholar 

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:046110

    Article  Google Scholar 

  • Li Y, Fan J, Wang Y, Tan K-L (2018) Influence maximization on social graphs: A survey. IEEE Trans on Knowledge and Data Eng 30(10):1852–1872

    Article  Google Scholar 

  • Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining pp 439–448

  • Lu Z, Zhang W, Wu W, Fu B, Du D (2011, June) Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: 2011 31st international conference on distributed computing systems workshops pp 160–165

  • Lu Z, Zhang W, Wu W, Kim J, Fu B (2012) The complexity of influence maximization problem in the deterministic linear threshold model. J of Combinatorial Optim 24(3):374–378

    Article  Google Scholar 

  • Michael K, Markus L, Ivana L (2022) The impact of passive social media users in (competitive) influence maximization. Technical report. University of Vienna, Austria

  • Nannicini G, Sartor G, Traversi E, Calvo R (2020) An exact algorithm for robust influence maximization. Math Program 183:419–453

    Article  Google Scholar 

  • Nemhauser G, Wolsey L, Fisher M (1978) An analysis of the approximations for maximizing submodular set functions. Math Program 14:265–294

    Article  Google Scholar 

  • Qiang Z, Pasiliao EL, Zheng QP (2019) Model-based learning of information diffusion in social media networks. Appl Network Sci 4(1):1–16

    Article  Google Scholar 

  • Riquelme F, Gonzalez-Cantergiani P, Molinero X, Serna M (2018) Centrality measure in social networks based on linear threshold model. Knowledge-Based Syst 140:92–102

    Article  Google Scholar 

  • Rosa D, Giua A (2013) On the spread of innovation in social networks. IFAC Proc Volumes 46(27):322–327

    Article  Google Scholar 

  • Shunyu Y, Neng F, Jie H (2022) Modeling the spread of infectious diseases through influence maximization. Optim Letters 16:1563–1586

    Article  Google Scholar 

  • Talukder A, Alam MGR, Tran NH, Niyato D, Park GH, Hong CS (2019) Threshold estimation models for linear threshold-based influential user mining in social networks. IEEE Access 7:105441–105461

    Article  Google Scholar 

  • Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’-networks. Nature 393(6684):440–442

    Article  Google Scholar 

  • Wu H-H, Küçükyavuz S (2018) A two-stage stochastic programming approach for influence maximization in social networks. Comput Optim and Appl 69(3):563–595

    Article  Google Scholar 

  • Xu R (2013) An Lp norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model. In: Bonato A, Mitzenmacher M, Prałat P (eds) Algorithms and models for the web graph. Springer International Publishing, Canada, pp 144–155

    Chapter  Google Scholar 

  • Yang L, Giua A, Li Z (2017) Minimizing the influence propagation in social networks for linear threshold models. IFACPapersOnLine 50:14465–14470

    Google Scholar 

Download references

Acknowledgements

We thank our reviewers for their critical comments and valuable suggestions that highlighted important details and helped us in improving our paper. The research has been supported by the grant TKP2021-NVA-09 of the Ministry for Innovation and Technology, Hungary and by the grant SNN-135643 of the National Research, Development and Innovation Office, Hungary.

Author information

Authors and Affiliations

  1. Department of Computational Optimization, University of Szeged, Szeged, Hungary

    Eszter Julianna Csókás & Tamás Vinkó

Authors
  1. Eszter Julianna Csókás
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Tamás Vinkó
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Tamás Vinkó.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Csókás, E.J., Vinkó, T. An exact method for influence maximization based on deterministic linear threshold model. Cent Eur J Oper Res 31, 269–286 (2023). https://doi.org/10.1007/s10100-022-00807-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-022-00807-3

Keywords

Mathematics Subject Classification