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

完全图上的强点加强随机游动

Strongly Vertex-Reinforced-Random-Walk on the complete graph

Michel Benaïm, Olivier Raimond, Bruno Schapira

摘要:

本文研究了权为$w(n)=n^α$的完全图上的顶点加强随机游动问题,其中权为$α>1$ .与边缘增强随机游动不同,在这种情况下,边缘增强随机游动将a. s.在2个位置上,我们观察到各种相变,特别是在任意大的集合上的局部化是可能的,只要$α$足够接近1。我们的证明依赖于随机逼近技术。在文章的最后,我们还证明了一个一般性的结果,确保任何有界度图上的任何强加强VRRW局部化a.s.一个有限子图

英文摘要:

We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form $w(n)=n^α$, with $α>1$. Unlike for the Edge-Reinforced-Random-Walk, which in this case localizes a.s. on 2 sites, here we observe various phase transitions, and in particular localization on arbitrary large sets is possible, provided $α$ is close enough to 1. Our proof relies on stochastic approximation techniques. At the end of the paper, we also prove a general result ensuring that any strongly reinforced VRRW on any bounded degree graph localizes a.s. on a finite subgraph.

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

↑