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

Galton-Watson树上有偏随机游动的中心极限定理

A Central Limit Theorem for biased random walks on Galton-Watson trees

Yuval Peres, Ofer Zeitouni

摘要:

设${\cal T}$是一个有根的Galton-Watson树,其后代分布$\{p_k\}$具有$p_0=0$、平均$m=\sum kp_k>1$和指数尾。考虑${\cal T}$上的$λ$偏置随机游走$\{X_n\}_{n\geq 0}$;这是最近邻随机游走,当在具有$d_v$后代的顶点$v$处时,以概率$λ/(λ+d_v)$移动到更靠近根,并且以概率$1/(λ+d_v)$移动到每个后代。据了解,这条路有一个A. S。恒速$\v=\lim_n |X_n|/n$(其中$|X_n|$是$X_n$距根部的距离),$\v>0$代表$ 0<λ<m$,$\v=0$代表$λ\ge m$。对于所有的$λ\le m$,我们证明了一个淬火CLT为$|X_n|-n\v$。(For $λ>m$步行是阳性复发,没有CLT。)到目前为止,最有趣的情况是$λ=m$,其中CLT具有以下形式:对于几乎每个${\cal T}$,比率$|X_{[nt]}|/\sqrt{n}$按规律收敛为$n \to \infty$到布朗运动绝对值的确定性倍数。我们对这种情况的方法是基于一个明确的描述的一个不变的措施,从粒子的角度来看(以前,这样的措施是明确已知的只有$λ=1$)和建设适当的调和坐标的步行。

英文摘要:

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $λ$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the nearest neighbor random walk which, when at a vertex $v$ with $d_v$ offspring, moves closer to the root with probability $λ/(λ+d_v)$, and moves to each of the offspring with probability $1/(λ+d_v)$. It is known that this walk has an a.s. constant speed $\v=\lim_n |X_n|/n$ (where $|X_n|$ is the distance of $X_n$ from the root), with $\v>0$ for $ 0<λ<m$ and $\v=0$ for $λ\ge m$. For all $λ\le m$, we prove a quenched CLT for $|X_n|-n\v$. (For $λ>m$ the walk is positive recurrent, and there is no CLT.) The most interesting case by far is $λ=m$, where the CLT has the following form: for almost every ${\cal T}$, the ratio $|X_{[nt]}|/\sqrt{n}$ converges in law as $n \to \infty$ to a deterministic multiple of the absolute value of a Brownian motion. Our approach to this case is based on an explicit description of an invariant measure for the walk from the point of view of the particle (previously, such a measure was explicitly known only for $λ=1$) and the construction of appropriate harmonic coordinates.

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

↑