Skip to main content
Springer Nature Link
Log in

Rumor Blocking

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 244 Accesses

Years and Authors of Summarized Original Work

  • 2008; Kimura, Saito, Motoda

  • 2011; Budak, Agrawal, Abbadi

  • 2013; Fan, Lu, Wu, Thuraisingham, Ma, Bi

Problem Definition

The aim is to design effective algorithms for controlling rumor propagation in social networks. Here, a rumor is viewed as an undesirable thing. Social networks are represented by undirected or directed graphs, depending on different contexts. In these graphs, nodes denote individuals and edges denote the influence between individuals.

A list of strategies has been proposed to limit the spread of a rumor in a network. We group some of the existing research works into two categories. The first one includes the works that launch the opposite cascade, protector, to spread in a network, such that the number of nodes that adopt the rumor at the end of both cascades diffusion is limited. The second contains the works that are concerned with the network structure, that is, they control the rumor propagation by blocking some edges or...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bao Y, Niu Y, Yi C, Xue Y (2014) Effective immunization strategy for rumor propagation based on maximum spanning tree. In: Computing, Networking and Communications (ICNC), 2014 International Conference on, pp 11–15, DOI:10.1109/ICCNC.2014.6785296

    Google Scholar 

  2. Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Srinivasan S, Ramamritham K, Kumar A, Ravindra MP, Bertino E, Kumar R (eds) WWW, ACM, pp 665–674

    Google Scholar 

  3. Fan L, Lu Z, Wu W, Thuraisingham BM, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: ICDCS, IEEE, pp 540–549

    Google Scholar 

  4. He J, Liang H, Yuan H (2011) Controlling infection by blocking nodes and links simultaneously. In: Chen N, Elkind E, Koutsoupias E (eds) WINE, Springer, Lecture Notes in Computer Science, vol 7090, pp 206–217

    Google Scholar 

  5. He X, Song G, Chen W, Jiang Q (2012) Inuence blocking maximization in social networks under the competitive linear threshold model. In: SDM, SIAM / Omnipress, pp 463–474

    Google Scholar 

  6. Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of inuence through a social network. In: Getoor L, Senator TE, Domingos P, Faloutsos C (eds) KDD, ACM, pp 137–146

    Google Scholar 

  7. Kimura M, Saito K, Nakano R (2007) Extracting inuential nodes for information diusion on a social network. In: AAAI, AAAI Press, pp 1371–1376

    Google Scholar 

  8. Kimura M, Saito K, Motoda H (2008) Minimizing the spread of contamination by blocking links in a network. In: Fox D, Gomes CP (eds) AAAI, AAAI Press, pp 1175–1180

    Google Scholar 

  9. Kimura M, Saito K, Motoda H (2008) Solving the contamination minimization problem on networks for the linear threshold model. In: Ho TB, Zhou ZH (eds) PRICAI, Springer, Lecture Notes in Computer Science, vol 5351, pp 977–984

    Google Scholar 

  10. Li S, Zhu Y, Li D, Kim D, Huang H (2013) Rumor restriction in online social networks. In: IPCCC, IEEE, pp 1–10

    Google Scholar 

  11. Nguyen N, Xuan Y, Thai M (2010) A novel method for worm containment on dynamic social networks. In: MILITARY COMMUNICATIONS CONFERENCE, 2010 - MILCOM 2010, pp 2180–2185, DOI:10.1109/MILCOM.2010.5680488

    Google Scholar 

  12. Nguyen NP, Yan G, Thai MT, Eidenbenz S (2012) Containment of misinformation spread in online social networks. In: Contractor NS, Uzzi B, Macy MW, Nejdl W (eds) WebSci, ACM, pp 213–222

    Google Scholar 

  13. Tsai J, Nguyen TH, Tambe M (2012) Security games for controlling contagion. In: Homann J, Selman B (eds) AAAI, AAAI Press

    Google Scholar 

  14. Zhu Z, Cao G, Zhu S, Ranjan S, Nucci A (2009) A social network based patching scheme for worm containment in cellular networks. In: INFOCOM, IEEE, pp 1476-1484

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Texas, Tyler, TX, USA

    Lidan Fan

  2. College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan, Shanxi Province, China

    Weili Wu

  3. Department of Computer Science, California State University, Los Angeles, CA, USA

    Weili Wu

  4. Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

Authors
  1. Lidan Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lidan Fan .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Fan, L., Wu, W. (2016). Rumor Blocking. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_623

Download citation

Publish with us

Policies and ethics