Take two four-cycles, connect corresponding vertices, and connect each inner vertex to an absorbing hub. For the ordinary random walk on a graph, symmetry reduces mean remaining times to outer and inner types, satisfying and . Thus , . For the non-backtracking random walk, directed-edge types outer-outer, outer-inner, inner-outer and inner-inner give remaining means . Starting at an outer vertex, the first-step distribution yields total mean .
Articles by others on the same topic
There are currently no matching articles.