Translator Disclaimer
2015 Rumor source detection for rumor spreading on random increasing trees
Michael Fuchs, Pei-Duo Yu
Author Affiliations +
Electron. Commun. Probab. 20: 1-12 (2015). DOI: 10.1214/ECP.v20-3743

Abstract

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.

Citation

Download Citation

Michael Fuchs. Pei-Duo Yu. "Rumor source detection for rumor spreading on random increasing trees." Electron. Commun. Probab. 20 1 - 12, 2015. https://doi.org/10.1214/ECP.v20-3743

Information

Accepted: 6 January 2015; Published: 2015
First available in Project Euclid: 7 June 2016

zbMATH: 1306.05223
MathSciNet: MR3304408
Digital Object Identifier: 10.1214/ECP.v20-3743

Subjects:
Primary: 05C80
Secondary: 60C05

JOURNAL ARTICLE
12 PAGES


SHARE
Back to Top