pith. sign in

arxiv: 1212.6390 · v1 · pith:DS3W5XKKnew · submitted 2012-12-27 · 🧮 math.PR · math-ph· math.MP

Non-backtracking random walk

classification 🧮 math.PR math-phmath.MP
keywords eigensystemnon-backtrackingrandomwalkcentralconsiderconvergencedegree
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.