arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.01558math.PRmath-phmath.MP
收藏

随机定向Manhattan格上的随机游动

Random walk on the randomly-oriented Manhattan lattice

Sean Ledger, Bálint Tóth, Benedek Valkó

摘要:

在随机取向的曼哈顿晶格中,$\mathbb{Z}^d$中的每条线都被分配了均匀的随机方向。我们考虑顶点集为$\mathbb{Z}^d$的有向图,其边连接最近的邻居,但仅在由线方向固定的方向上。在这个有向图上的随机游动在每一步从$d$合法邻居中均匀地选择。我们证明,这种行走是超扩散在二维和三维。该模型是在四个和更多的维度扩散。

英文摘要:

In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the direction fixed by the line orientations. Random walk on this directed graph chooses uniformly from the $d$ legal neighbours at each step. We prove that this walk is superdiffusive in two and three dimensions. The model is diffusive in four and more dimensions.

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

↑