开放课件详细信息
PIMS-MPrime Summer School in Probability
Cut points for simple random walks
授课人:Daisuke Shiraishi
机构:Pacific Institute for the Mathematical Sciences(PIMS)
关键词: Scientific;    Mathematics;    Probability;    Random Walk;   
加拿大|英语
【 摘 要 】
We consider two random walks conditioned 鈥渘ever to intersect鈥?in Z^2. We show that each of them has infinitely many `global' cut times with probability one. In fact, we prove that the number of global cut times up to n grows like n^{3/8}. Next we consider the union of their trajectories to be a random subgraph of Z^2 and show the subdiffusivity of the simple random walk on this graph.
【 授权许可】

CC BY-NC-ND   
Except where explicitly noted elsewhere, the works on this site are licensed under a Creative Commons License: CC BY-NC-ND

附件列表
Files Size Format View
RO201805250000408SX.mp4 KB MovingImage download
  文献评价指标  
  下载次数:157次 浏览次数:131次