The Maximum of a Random Walk and Its Application to Rectangle Packing
The Maximum of a Random Walk and Its Application to Rectangle Packing(1998)
摘要
Let $S_0, \ldots ,S_n$ be a symmetric random walk that starts at the origin ($S_0=0$), and takes steps uniformly distributed on $[-1,+1]$. We study the large-$n$ behavior of the expected maximum excursion and prove the estimate
更多查看译文
关键词
symmetric random walk,rectangle packing,expected maximum excursion,random walk
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络