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

Optimization on Content Spread in Social Network Studies

In: Nonlinear Combinatorial Optimization

Author

Listed:
  • Yi Li

    (The University of Texas at Dallas)

  • Ruidong Yan

    (School of Information, Renmin University of China)

  • Weili Wu

    (The University of Texas at Dallas)

Abstract

With the rapid growth of online social networks, people change the way of generating, sharing, and spreading various social contents. The contagiousness of social content is highly depending on the size of of seed nodes and connectivity of the network. In this study, we propose the optimization problems of information content diffusion over social networks. The content here can be either useful information such as news, innovation ideas, and marketing purpose content or negative content such as misinformation and malicious rumors. We show that the optimization problem on information diffusion has been discussed in previous researches from different aspects using different approaches. In our study, we formulate two optimization problems—content spread maximization and misinformation minimization—which are both NP-hard and non-submodular. To tackle the difficulty of these problems we sandwich approximation which has data-dependent guarantees.

Suggested Citation

  • Yi Li & Ruidong Yan & Weili Wu, 2019. "Optimization on Content Spread in Social Network Studies," Springer Optimization and Its Applications, in: Ding-Zhu Du & Panos M. Pardalos & Zhao Zhang (ed.), Nonlinear Combinatorial Optimization, pages 273-284, Springer.
    • Handle: RePEc:spr:spochp:978-3-030-16194-1_13
    DOI: 10.1007/978-3-030-16194-1_13
    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.

    More about this item

    Statistics

    Access and download statistics

    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-16194-1_13. 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.