1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.PR2018
Uniform spanning forests associated with biased random walks on Euclidean lattices
Zhan Shi, Vladas Sidoravicius, He Song +2
The uniform spanning forest measure () on a locally finite, infinite connected graph with conductance is defined as a weak limit of uniform spanning tree meas…
math.PR2018
On Spectral Radius of Biased Random Walks on Infinite Graphs
Zhan Shi, Vladas Sidoravicius, He Song +2
We consider a class of biased random walks on infinite graphs and present several general results on the spectral radius of biased random walk.
math.PR2017★ 1 cited
Cutpoints for Random Walks on Quasi-Transitive Graphs
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…