Cyclic behavior of maxima in a hierarchical summation scheme
Preprint
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.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Convergence in law of the minimum of a branching random walkThe Annals of Probability, 2013
- Minima in branching random walksThe Annals of Probability, 2009
- Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered treesThe Annals of Probability, 2009
- Tightness for a family of recursion equationsThe Annals of Probability, 2009
- Convergence of solutions of the Kolmogorov equation to travelling wavesMemoirs of the American Mathematical Society, 1983
- Minimal displacement of branching random walkProbability Theory and Related Fields, 1978
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974