Paperlane

no. 15 · Monday 16 November 2026

Cover times of random recursive trees and linear preferential attachment trees

Omer Angel, Christina Goldschmidt and Peleg Michaeli

math.PR · 15 pp

Abstract

We study the cover times of uniform random recursive trees and linear preferential attachment trees, including the negative-parameter models corresponding to random $d$-ary increasing trees. We prove explicit limits in probability and expectation when the cover times are rescaled by $n (\log n)^2$. In particular, for the uniform random recursive tree the cover time is close to $e n (\log n)^2$ with high probability.

comments
15 pages, 1 figure
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.18353 ↗