arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0612382math.PR

Tightness for a family of recursion equations

Maury Bramson, Ofer Zeitouni

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑