Abstract
Let G be a connected graph of uniformly bounded degree. A k non-backtracking random walk (k-NBRW) (X-n)(n=0)(infinity) on G evolves according to the f......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
