Rumors in a Network: Who's the Culprit?
We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with the popular susceptible-infected (SI) model and then construct an estimator for the rumor source. This estimator is based upon a novel topological quantity which we...
Main Authors: | Shah, Devavrat, Zaman, Tauhid R. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/88122 https://orcid.org/0000-0003-0737-3259 https://orcid.org/0000-0003-4973-9343 |
Similar Items
-
Finding Rumor Sources on Random Graphs
by: Shah, Devavrat, et al.
Published: (2013) -
Finding Rumor Sources on Random Trees
by: Shah, Devavrat, et al.
Published: (2017) -
Information extraction with network centralities : finding rumor sources, measuring influence, and learning community structure
by: Zaman, Tauhid R
Published: (2012) -
Detecting sources of computer viruses in networks: Theory and experiment
by: Shah, Devavrat, et al.
Published: (2011) -
Sclerotherapy: who is the culprit?
by: D. S. Zubkov
Published: (2021-01-01)