Abstract by Cory Glover
Spectral Properties of Non-backtracking Random Walks
Non-backtracking random walks on a graph add the stipulation that a simple random walk cannot travel to the previous vertex it was at. We look at the spectral properties of non-backtracking random walks in order to better understand their relationship with simple random walks on graphs. An invariant subspace can be used to better understand the non-backtracking random walk. Further, we investigate the effect of the non-backtracking condition on the PageRank of a graph.