论文信息 - Non-backtracking Random Walk

Non-backtracking Random Walk

We consider non-backtracking random walk (NBW) in the nearest-neighbor setting on the ℤd-lattice and on tori. We evaluate the eigensystem of the m×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 ℤd and to obtain estimates on the convergence towards the stationary distribution for NBW on the torus.

Remco van der Hofstad | Robert Fitzner | R. Hofstad | R. Fitzner

[1] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[2] Pand Peter Tittmann. Improved Upper Bounds for Self-Avoiding , 2000 .

[3] P. Rousseeuw,et al. Wiley Series in Probability and Mathematical Statistics , 2005 .

[4] Peter Tittmann,et al. Improved Upper Bounds for Self-Avoiding Walks in Zd , 2000, Electron. J. Comb..

[5] Patrick Billingsley,et al. Probability and Measure. , 1986 .

[6] Remco van der Hofstad,et al. Hypercube percolation , 2012 .

[7] N. Madras,et al. THE SELF-AVOIDING WALK , 2006 .

[8] D. Aldous. Minimization Algorithms and Random Walk on the $d$-Cube , 1983 .

[9] André Pönitz,et al. Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$ , 2000 .

[10] N. Alon,et al. Non-backtracking random walks mix faster , 2006, math/0610550.

[11] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .

[12] Noga Alon,et al. Poisson approximation for non-backtracking random walks , 2007 .

[13] T. Sunada,et al. Zeta Functions of Finite Graphs , 2000 .

[14] Asaf Nachmias,et al. Unlacing hypercube percolation: a survey , 2013 .

[15] Ronald Ortner,et al. Non-Backtracking Random Walks and Cogrowth of Graphs , 2004, Canadian Journal of Mathematics.

[16] J. Noonan,et al. New Upper Bounds for the Connective Constants of Self-Avoiding Walks , 1998 .

[17] Jean Picard,et al. The Lace Expansion and its Applications , 2006 .