4 citations · 13 across the 10 of their papers we have counts for
1 paper · 1 filter
He Song, Kainan Xiang
We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infi…