arXiv:0711.2675 Abstract | arXiv Analytics

arXiv:0711.2675 [math.PR]Abstract References Reviews Resources

A note on random walks in a hypercube

Published 2007-11-16Version 1

We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in Doyle, P., and Snell, J., "Random Walks and Electric Networks", Mathematical Association of America, 1984 (see Exercise 1.3.7 there).

Categories: math.PR, math.CO

Subjects: 60G50, 60J45

Keywords: hitting vertex, simple random walk, n-dimensional hypercube, electric networks, starting position

Related articles: Most relevant | Search more

arXiv:0902.4369 [math.PR] (Published 2009-02-25)

Strong limit theorems for a simple random walk on the 2-dimensional comb

E. Csaki, M. Csorgo, A. Foldes, P. Revesz

arXiv:math/0006173 [math.PR] (Published 2000-06-22)

Favourite sites of simple random walk

Zhan Shi, Balint Toth

arXiv:math/0011092 [math.PR] (Published 2000-11-14, updated 2002-02-26)

On the mixing time of simple random walk on the super critical percolation cluster