Article ID: 2022XBL0146
The non-backtracking random walk is known to have nicer properties than simple random walks. However, the effect of graph structure on the properties of the non-backtracking random walk has not been fully clarified. In this paper, we elucidate the mean first passage time of the non-backtracking random walk on two different types of graphs with different characteristics as well as the mean cover time on random regular graphs. Furthermore, we analyze the effects of the graph structure on the properties of the non-backtracking random walk using several numerical examples. Our findings include that the number of nodes in random regular graphs has a great impact on the mean first passage time of the non-backtracking random walk.
