IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i1d10.1007_s10878-015-9939-x.html
   My bibliography  Save this article

A novel approach for detecting multiple rumor sources in networks with partial observations

Author

Listed:
  • Zhao Zhang

    (Zhejiang Normal University)

  • Wen Xu

    (University of Texas at Dallas)

  • Weili Wu

    (University of Texas at Dallas)

  • Ding-Zhu Du

    (Ton Duc Thang University
    University of Texas at Dallas)

Abstract

Locating source of information diffusion in networks has very important applications such as locating the sources of epidemics, news/rumors in social networks or online computer virus. In this paper, we consider detecting multiple rumor sources from a deterministic point of view by modeling it as the set resolving set (SRS) problem. Let G be a network on n nodes. A node subset K is an SRS of G if all detectable node sets are distinguishable by K. The problem of multiple rumor source detection (MRSD) in the network can be modeled as finding an SRS K with the smallest cardinality. In this paper, we propose a polynomial-time greedy algorithm for finding a minimum SRS in a general network, achieving performance ratio $$O(\ln n)$$ O ( ln n ) . This is the first work establishing a relation between the MRSD problem and a deterministic concept of SRS, and a first work to give the minimum SRS problem a polynomial-time performance-guaranteed approximation algorithm. Our framework suggests a robust and efficient approach for estimating multiple rumor sources independent of diffusion models in networks.

Suggested Citation

  • Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du, 2017. "A novel approach for detecting multiple rumor sources in networks with partial observations," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 132-146, January.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9939-x
    DOI: 10.1007/s10878-015-9939-x
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Cristopher Moore & M. E. J. Newman, 2000. "Epidemics and Percolation in Small-World Networks," Working Papers 00-01-002, Santa Fe Institute.
    2. Ding-Zhu Du & Ker-I Ko & Xiaodong Hu, 2012. "Design and Analysis of Approximation Algorithms," Springer Optimization and Its Applications, Springer, number 978-1-4614-1701-9, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang, 2019. "Maximizing profit of multiple adoptions in social networks with a martingale approach," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 1-20, July.
    2. Suisheng Yu & Mingcai Li & Fengming Liu, 2017. "Rumor Identification with Maximum Entropy in MicroNet," Complexity, Hindawi, vol. 2017, pages 1-8, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ganjeh-Ghazvini, Mostafa & Masihi, Mohsen & Ghaedi, Mojtaba, 2014. "Random walk–percolation-based modeling of two-phase flow in porous media: Breakthrough time and net to gross ratio estimation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 214-221.
    2. Pan, Ya-Nan & Lou, Jing-Jing & Han, Xiao-Pu, 2014. "Outbreak patterns of the novel avian influenza (H7N9)," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 401(C), pages 265-270.
    3. Greg Morrison & L Mahadevan, 2012. "Discovering Communities through Friendship," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    4. Floortje Alkemade & Carolina Castaldi, 2005. "Strategies for the Diffusion of Innovations on Social Networks," Computational Economics, Springer;Society for Computational Economics, vol. 25(1), pages 3-23, February.
    5. Qin, Yang & Zhong, Xiaoxiong & Jiang, Hao & Ye, Yibin, 2015. "An environment aware epidemic spreading model and immune strategy in complex networks," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 206-215.
    6. Velarde, Carlos & Robledo, Alberto, 2021. "Statistical mechanical model for growth and spread of contagions under gauged population confinement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 573(C).
    7. I. Vieira & R. Cheng & P. Harper & V. Senna, 2010. "Small world network models of the dynamics of HIV infection," Annals of Operations Research, Springer, vol. 178(1), pages 173-200, July.
    8. Sáenz-Royo, Carlos & Lozano-Rojo, Álvaro, 2023. "Authoritarianism versus participation in innovation decisions," Technovation, Elsevier, vol. 124(C).
    9. Vilches, T.N. & Esteva, L. & Ferreira, C.P., 2019. "Disease persistence and serotype coexistence: An expected feature of human mobility," Applied Mathematics and Computation, Elsevier, vol. 355(C), pages 161-172.
    10. Tomovski, Igor & Kocarev, Ljupčo, 2015. "Network topology inference from infection statistics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 272-285.
    11. Li, Xun & Cao, Lang, 2016. "Diffusion processes of fragmentary information on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 624-634.
    12. Foti, Nicholas J. & Pauls, Scott & Rockmore, Daniel N., 2013. "Stability of the World Trade Web over time – An extinction analysis," Journal of Economic Dynamics and Control, Elsevier, vol. 37(9), pages 1889-1910.
    13. Yin, Rongrong & Wang, Yumeng & Li, Linhui & Zhang, Le & Hao, Zhenyang & Lang, Chun, 2024. "A mobile node path optimization approach based on Q-learning to defend against cascading failures on static-mobile networks," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    14. Kumar, Ajay & Swarnakar, Pradip & Jaiswal, Kamya & Kurele, Ritika, 2020. "SMIR model for controlling the spread of information in social networking sites," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    15. Yang, Dingda & Liao, Xiangwen & Shen, Huawei & Cheng, Xueqi & Chen, Guolong, 2018. "Modeling the reemergence of information diffusion in social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 1493-1500.
    16. Ramos, A.B.M. & Schimit, P.H.T., 2019. "Disease spreading on populations structured by groups," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 265-273.
    17. Ball, Frank & Neal, Peter, 2003. "The great circle epidemic model," Stochastic Processes and their Applications, Elsevier, vol. 107(2), pages 233-268, October.
    18. Mahendra Piraveenan & Mikhail Prokopenko & Liaquat Hossain, 2013. "Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks," PLOS ONE, Public Library of Science, vol. 8(1), pages 1-14, January.
    19. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-16, January.
    20. Jiao Zhou & Zhao Zhang & Weili Wu & Kai Xing, 2014. "A greedy algorithm for the fault-tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 310-319, 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:33:y:2017:i:1:d:10.1007_s10878-015-9939-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.