2000 character limit reached
Non-backtracking random walk (1212.6390v1)
Published 27 Dec 2012 in math.PR, math-ph, and math.MP
Abstract: We consider non-backtracking random walk (NBW) in the nearest-neighbor setting on the Zd-lattice and on tori. We evaluate the eigensystem of the m X m-dimensional transition matrix of NBW where m denote the degree of the graph. We use its eigensystem to show a functional central limit theorem for NBW on Zd and to obtain estimates on the convergence towards the stationary distribution for NBW on the torus.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.