A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Finding Rumor Sources on Random Trees
[article]
2015
arXiv
pre-print
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when these nodes became infected. In a recent work ref:rc this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the
arXiv:1110.6230v3
fatcat:pb4lnyj7vjcu5hse5vgvimvczu