Simple random walk on the hypercube (source code)

= Simple random walk on the hypercube

On the $n$-dimensional <hypercube graph>, <simple random walk> flips one uniformly chosen coordinate at each step. Its <stationary distribution> is uniform on the $2^n$ vertices, so its <mean> return time is $2^n$.