The expected decompressed tree size of a uniform random k-ary chain of size n grows asymptotically with a stretched exponential factor e^{c sqrt(n)}.
Repeated fringe subtrees in random rooted trees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The decompressed tree size of $k$-ary chains
The expected decompressed tree size of a uniform random k-ary chain of size n grows asymptotically with a stretched exponential factor e^{c sqrt(n)}.