IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-28565-4_22.html
   My bibliography  Save this book chapter

Influence Maximization in Social Networks

In: Optimization in Large Scale Problems

Author

Listed:
  • Shashank Sheshar Singh

    (Indian Institute of Technology (BHU))

  • Ajay Kumar

    (Indian Institute of Technology (BHU))

  • Shivansh Mishra

    (Indian Institute of Technology (BHU))

  • Kuldeep Singh

    (Indian Institute of Technology (BHU))

  • Bhaskar Biswas

    (Indian Institute of Technology (BHU))

Abstract

Influence maximization (IM) is the problem of identifying a small subset of influential users such that influence spread in a network can be maximized. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing, election campaign, counter-terrorism efforts, rumor control, and sales promotions, etc. In this paper, we perform a comparative review of the existing IM algorithms. First, we present a comprehensive study on existing IM approaches with their comparative theoretical analysis. Then, we present a comparative analysis of existing IM methods with respect to performance metrics. Finally, we discuss the challenges and future directions of the research.

Suggested Citation

  • Shashank Sheshar Singh & Ajay Kumar & Shivansh Mishra & Kuldeep Singh & Bhaskar Biswas, 2019. "Influence Maximization in Social Networks," Springer Optimization and Its Applications, in: Mahdi Fathi & Marzieh Khakifirooz & Panos M. Pardalos (ed.), Optimization in Large Scale Problems, pages 255-267, Springer.
    • Handle: RePEc:spr:spochp:978-3-030-28565-4_22
    DOI: 10.1007/978-3-030-28565-4_22
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Tselykh & Vladislav Vasilev & Larisa Tselykh & Fernando A. F. Ferreira, 2022. "Influence control method on directed weighted signed graphs with deterministic causality," Annals of Operations Research, Springer, vol. 311(2), pages 1281-1305, April.
    2. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    3. Lin Zhang & Kan Li, 2021. "Influence Maximization Based on Backward Reasoning in Online Social Networks," Mathematics, MDPI, vol. 9(24), pages 1-17, December.
    4. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    5. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).

    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:spochp:978-3-030-28565-4_22. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.