{"id":"palomar/PALOMAR-2026-11-03-000030","url":"https://github.com/igor-kortchemski/freezing-growth-rrt/tree/72427804ae5471cca98ab5c8ec3297c0599ad042","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-03-000030-v1.json","repo":"https://github.com/igor-kortchemski/freezing-growth-rrt","tags":["math.PR","msc:05C05","msc:60C05"],"score":0,"title":"Does freezing impede the growth of random recursive trees?","trust":"high","domain":"math.PR","source":"palomar","authors":["Igor Kortchemski"],"reviews":0,"subject":"math.PR","summary":"We formalize the principal results of “Does freezing impede the growth of random recursive trees?” for uniform attachment trees with freezing. We prove uniform height lower bounds over all admissible operation sequences with n attachment steps: the height is at least e log n − 5 log log n with probability tending to one, uniformly over these sequences, and the same lower bound holds for expected height for sufficiently large n. We also formalize deletion comparisons: deleting attachment or freezing steps can increase expected height, whereas deleting the attachment–freezing pair at the first…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-03","reactions":{},"formalized":true,"formalizes":[{"title":"Does freezing impede the growth of random recursive trees?","identifier":"https://arxiv.org/abs/2505.16571v2","relationship":"formalizes"}]}