Can the root cluster remain largest forever in random recursive tree percolation?
Electronic Communications in Probability · 01.01.2026 · 31 (none) · 1-12
DOI: 10.1214/26-ecp832 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Communications in Probability, erschienen am 01.01.2026. Verfasst von Yushu Zheng. Die Arbeit nennt 11 Literaturangaben.
Abstract (Originalsprache)
We consider Bernoulli bond percolation with fixed retention parameter p on the random recursive tree, coupled through the natural growth process. We prove that for every p>0 the root cluster has a strictly positive probability of remaining the unique largest cluster at every time. Equivalently, in the associated Simon-type Chinese restaurant process, the first table has a positive probability of remaining the unique largest table forever. We further show that two associated quantities, the limit as n→∞ of the probability that the root cluster is the unique largest cluster at time n and the probability that it remains the unique largest cluster for all times, are strictly increasing and continuous functions of p on [0,1].
Zitieren
APA
Zheng, Y. (2026). Can the root cluster remain largest forever in random recursive tree percolation?. Electronic Communications in Probability, 31(none), 1-12. https://doi.org/10.1214/26-ecp832
Vancouver
Zheng Y. Can the root cluster remain largest forever in random recursive tree percolation?. Electronic Communications in Probability. 2026;31(none):1-12. doi:10.1214/26-ecp832
BibTeX
@article{Zheng2026,
author = {Zheng, Yushu},
title = {Can the root cluster remain largest forever in random recursive tree percolation?},
journal = {Electronic Communications in Probability},
year = {2026},
volume = {31},
number = {none},
pages = {1--12},
doi = {10.1214/26-ecp832}
}
EUVIMED