most citedMean first-passage time for random walks in general graphs with a deep trap

32 citations · 32 across the 1 of their papers we have counts for

collaborators

1 paper

cond-mat.stat-mech2012★ 32 cited

Mean first-passage time for random walks in general graphs with a deep trap

Yuan Lin, Alafate Julaiti, Zhongzhi Zhang

We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the…