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 Mn denote the maximum of all such sums. We prove that, as n grows, the distributions of Mn approach some helix in the space of distributions. Each element of this helix is an accumulation point for the shifts of distributions of Mn.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.