For uniform attachment trees, the optimal root-finding output size is exp(Theta(sqrt(log(1/epsilon)))), matching the known lower bound and resolving an open question.
Convex transform order of beta distributions with some consequences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal root recovery for uniform attachment trees and $d$-regular growing trees
For uniform attachment trees, the optimal root-finding output size is exp(Theta(sqrt(log(1/epsilon)))), matching the known lower bound and resolving an open question.