A note on random walks in a hypercube
Probability
2007-11-19 v1 Combinatorics
Abstract
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).
Cite
@article{arxiv.0711.2675,
title = {A note on random walks in a hypercube},
author = {Stanislav Volkov and Timothy Wong},
journal= {arXiv preprint arXiv:0711.2675},
year = {2007}
}