IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i1d10.1007_s10878-013-9635-7.html
   My bibliography  Save this article

Better approximation algorithms for influence maximization in online social networks

Author

Listed:
  • Yuqing Zhu

    (University of Texas at Dallas)

  • Weili Wu

    (University of Texas at Dallas)

  • Yuanjun Bi

    (University of Texas at Dallas)

  • Lidong Wu

    (University of Texas at Dallas)

  • Yiwei Jiang

    (Zhejiang Sci-Tech University)

  • Wen Xu

    (University of Texas at Dallas)

Abstract

Influence maximization is a classic and hot topic in social networks. In this paper, firstly we argue that in online social networks, due to the time sensitivity of popular topics, the assumption in IC or LT model that the influence propagates endlessly in the network, is not applicable. Based on this we consider influence transitivity and limited propagation distance in our new model. Secondly, under our model we propose Semidefinite based algorithms. While most existing algorithms rely on monotony and submodularity to obtain approximation ratio of $$1-1/e$$ 1 − 1 / e , when no size limitation exists on the number of seeds, our algorithm achieves approximation ratio with $$0.857$$ 0.857 , which is a great improvement. Moreover, when only a limited number of nodes can be chosen as seeds, based on computer-assisted proof, we claim our algorithm still keeps approximation ratio higher than $$1-1/e$$ 1 − 1 / e if the ratio of the seeds to the total number of nodes resides in a certain range. At last, we evaluate the effectiveness of our algorithms through extensive experiments on real world social networks.

Suggested Citation

  • Yuqing Zhu & Weili Wu & Yuanjun Bi & Lidong Wu & Yiwei Jiang & Wen Xu, 2015. "Better approximation algorithms for influence maximization in online social networks," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 97-108, July.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9635-7
    DOI: 10.1007/s10878-013-9635-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9635-7
    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/s10878-013-9635-7?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.

    Citations

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


    Cited by:

    1. C Prem Sankar & Asharaf S. & K Satheesh Kumar, 2016. "Learning from Bees: An Approach for Influence Maximization on Viral Campaigns," PLOS ONE, Public Library of Science, vol. 11(12), pages 1-15, December.
    2. Ailian Wang & Weili Wu & Lei Cui, 2016. "On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1678-1684, May.
    3. Abbas Salehi & Behrooz Masoumi, 2020. "KATZ centrality with biogeography-based optimization for influence maximization problem," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 205-226, July.

    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:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9635-7. 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.