supported partially by NSFC(Nos.11271204,11301371);Central South University of Forestry and Technology Project(No.(104|0292)0292);supported by Tianjin Normal University Project(No.52XB1206);Program for Innovative Research Team in Universities of Tianjin(No.TD13-5078);Science and Technology Development Project of Universities of Tianjin(No.JW1713)
证明了体积增长不低于5次多项式的拟顶点可迁图上的简单随机游走几乎处处有无穷多个切割时,从而有无穷多个切割点.该结论在所论情形下肯定了Benjamini,Gurel-Gurevich和Schramm在文[2011,Cutpoints and resistance of random walk paths...