Prefer a chat interface with context about you and your work?
A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
We present a short probabilistic proof of a weak convergence result for the number of cuts needed to isolate the root of a random recursive tree. The proof is based on a coupling related to a certain random walk.