arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.5682math.PR
收藏

蜘蛛随机游动的游程有多高

How Tall Can Be the Excursions of a Random Walk on a Spider

Antonia Foldes, Pal Revesz

摘要:

我们考虑一个简单的对称随机游动的蜘蛛,这是一个收集的射线(我们称之为腿)加入到原点。我们的主要问题是:如果步行者做$n$步骤,他可以走多高的所有腿。这个问题在两种不同的情况下讨论;当腿的数量增加时,因为$n$走向无穷大,当它是固定的。

英文摘要:

We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This problem is discussed in two different situations; when the number of legs are increasing, as $n$ goes to infinity and when it is fixed.

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

↑