%0 Journal Article %1 MR2510018 %A Bramson, Maury %A Zeitouni, Ofer %D 2009 %J Ann. Probab. %K Fisher-KPP branching_random_walk recursion_equations tightness %N 2 %P 615--653 %T Tightness for a family of recursion equations %U http://projecteuclid.org/euclid.aop/1241099923 %V 37 %X In this paper we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of a branching random walk in one dimension and the cover time of a symmetric simple random walk on regular binary trees. Recursion equations associated with the distribution functions of these quantities have been used to establish weak laws of large numbers. Here, we use these recursion equations to establish the tightness of the corresponding sequences of distribution functions after appropriate centering. We phrase our results in a fairly general context, which we hope will facilitate their application in other settings.

@article{MR2510018, abstract = {In this paper we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of a branching random walk in one dimension and the cover time of a symmetric simple random walk on regular binary trees. Recursion equations associated with the distribution functions of these quantities have been used to establish weak laws of large numbers. Here, we use these recursion equations to establish the tightness of the corresponding sequences of distribution functions after appropriate centering. We phrase our results in a fairly general context, which we hope will facilitate their application in other settings. }, added-at = {2009-10-15T23:16:33.000+0200}, author = {Bramson, Maury and Zeitouni, Ofer}, biburl = {https://www.bibsonomy.org/bibtex/20f94cd71b87e82b19f8be1c9a4cfb790/peter.ralph}, coden = {APBYAE}, description = {MR: Publications results for "MR Number=(2510018)"}, fjournal = {The Annals of Probability}, interhash = {963617f28476384125238e6dd3b10839}, intrahash = {0f94cd71b87e82b19f8be1c9a4cfb790}, issn = {0091-1798}, journal = {Ann. Probab.}, keywords = {Fisher-KPP branching_random_walk recursion_equations tightness}, mrclass = {60J80 (60G50)}, mrnumber = {MR2510018}, number = 2, pages = {615--653}, timestamp = {2009-10-15T23:16:33.000+0200}, title = {Tightness for a family of recursion equations}, url = {http://projecteuclid.org/euclid.aop/1241099923}, volume = 37, year = 2009 }