约束随机游动模型的组合方法
A combinatorial approach to a model of constrained random walkers
摘要:
在文献[1]中,作者考虑了随机游动$(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$,其约束条件是游动的每个坐标与下一个坐标的距离为1。证明了第一坐标的泛函中心极限定理,并给出了极限方差的显式表达式。在本文中,我们研究了这个模型的一个扩展版本的条件极值坐标是在某个固定的距离在每一个时间。证明了该随机游动的一个泛函中心极限定理。利用组合工具,我们给出了方差的精确公式,并与文献[1]中的公式进行了比较。
英文摘要:
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first coordinate is proved and the limit variance is explicited. In this paper, we study an extended version of this model by conditioning the extremal coordinates to be at some fixed distance at every time. We prove a functional central limit theorem for this random walk. Using combinatorial tools, we give a precise formula of the variance and compare it with the one obtained in [1].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。