...
首页> 外文期刊>Electronic Journal of Probability >Spread of visited sites of a random walk along the generations of a branching process
【24h】

Spread of visited sites of a random walk along the generations of a branching process

机译:沿着分支过程的代数传播随机走访的访问站点

获取原文
   

获取外文期刊封面封底 >>

       

摘要

In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree.?We consider the case where the log-Laplace transform $psi$ of the branching process satisfies $psi(1)=psi'(1)=0$ for which G. Faraud, Y. Hu and Z. Shi have shown that, with probability one, the largest generation visited by the walk, until the instant $n$, is of the order of $(log n)^3$. We already proved that the largest generation entirely visited behaves almost surely like $log n$ up to a constant.?Here we study how the walk visits the generations $ell=(log n)^{1+ zeta}$, with $0 < zeta <2$. We obtain results in probability giving the asymptotic logarithmic behavior of the number of visited sites at a given generation. We prove that there is a phase transition at generation $(log n)^2$ for the mean of visited sites until $n$ returns to the root. Also we show that the visited sites spread all over the tree until generation $ell$.
机译:在本文中,我们考虑了在超临界Galton-Watson树上的随机环境中的零循环随机游走。 psi'(1)= 0 $,G。Faraud,Y。Hu和Z. Shi已证明,直到出现$ n $时,步行走过的最大一代的概率约为1。 $( log n)^ 3 $。我们已经证明,被访问的最大一代几乎可以肯定地像$ log n $,直到一个常数。在这里,我们研究步行如何访问世代$ ell =( log n)^ {1+ zeta} $ ,其中$ 0 < zeta <2 $。我们获得给出给定世代访问站点数量的渐近对数行为的概率结果。我们证明在生成的$( log n)^ 2 $处存在一个相变,表示访问站点的平均值,直到$ n $返回根为止。我们还显示访问的站点遍布树,直到生成$ ell $。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号