Rumor source detection for rumor spreading on random increasing trees

Michael Fuchs*, Pei Duo Yu

*Corresponding author for this work

研究成果: Article同行評審

12 引文 斯高帕斯(Scopus)

摘要

In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator for rumor spreading on random graphs. They proved for a very general random tree model that the detection probability remains positive as the number of nodes to which the rumor has spread tends to infinity. Moreover, they derived explicit asymptotic formulas for the detection probability of random d-regular trees and random geometric trees. In this paper, we derive asymptotic formulas for the detection probability of grown simple families of random increasing trees. These families of random trees contain important random tree models as special cases, e.g., binary search trees, recursive trees and plane-oriented recursive trees. Our results show that the detection probability varies from 0 to 1 across these families. Moreover, a brief discussion of the rumor center for unordered trees is given as well.

原文English
頁(從 - 到)1-12
頁數12
期刊Electronic Communications in Probability
20
DOIs
出版狀態Published - 1 一月 2015

指紋 深入研究「Rumor source detection for rumor spreading on random increasing trees」主題。共同形成了獨特的指紋。

引用此