Cyclic behavior of maxima in a hierarchical summation scheme

Abstract

Let i.i.d. symmetric Bernoulli random variables be associated to the edges of a binary tree having n levels. To any leaf of the tree, we associate the sum of variables along the path connecting the leaf with the tree root. Let M_n denote the maximum of all such sums. We prove that, as n grows, the distributions of M_n approach some helix in the space of distributions. Each element of this helix is an accumulation point for the shifts of distributions of M_n.

References in corpus (2)

• Convergence in law of the minimum of a branching random walk
• Tightness for a family of recursion equations

Cited by in corpus (1)

• Oscillations in the height of the Yule tree and application to the binary search tree