A uniform random recursive tree polluted by an Erdős–Rényi graph with p=o(log n/n) still admits a root confidence set of size depending only on ε, not on n.
Addario-Berry, A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finding Adam in noisy trees
A uniform random recursive tree polluted by an Erdős–Rényi graph with p=o(log n/n) still admits a root confidence set of size depending only on ε, not on n.