证明了体积增长不低于5次多项式的拟顶点可迁图上的简单随机游走几乎处处有无穷多个切割时,从而有无穷多个切割点.该结论在所论情形下肯定了Benjamini,Gurel-Gurevich和Schramm在文[2011,Cutpoints and resistance of random walk paths...证明了体积增长不低于5次多项式的拟顶点可迁图上的简单随机游走几乎处处有无穷多个切割时,从而有无穷多个切割点.该结论在所论情形下肯定了Benjamini,Gurel-Gurevich和Schramm在文[2011,Cutpoints and resistance of random walk paths,Ann.Probab.,39(3):1122-1136]中提出的猜想:顶点可迁图上暂留简单随机游走几乎处处有无穷多个切割点.展开更多
Let be the simple random walk in zd, and SupPers f(n) is an integer-valued function and increases to infinity as n tends to infinity, and In this paper,a necessary and sufficient condition to ensure or 1 is derived fo...Let be the simple random walk in zd, and SupPers f(n) is an integer-valued function and increases to infinity as n tends to infinity, and In this paper,a necessary and sufficient condition to ensure or 1 is derived for d=3,4. This problem was first studied by P. Erdos and S.J. Taylor.展开更多
文摘证明了体积增长不低于5次多项式的拟顶点可迁图上的简单随机游走几乎处处有无穷多个切割时,从而有无穷多个切割点.该结论在所论情形下肯定了Benjamini,Gurel-Gurevich和Schramm在文[2011,Cutpoints and resistance of random walk paths,Ann.Probab.,39(3):1122-1136]中提出的猜想:顶点可迁图上暂留简单随机游走几乎处处有无穷多个切割点.
文摘Let be the simple random walk in zd, and SupPers f(n) is an integer-valued function and increases to infinity as n tends to infinity, and In this paper,a necessary and sufficient condition to ensure or 1 is derived for d=3,4. This problem was first studied by P. Erdos and S.J. Taylor.
