Random walks in a closed space

We present simulations for random walks on a giant cluster in a randomly occupied hypercube. A new algorithm does away with the need for large memory requirements. The data can be fitted to high precision using stretched exponentials; confirming earlier conclusions, the results underline the strong resemblance between the decay behaviour in this mathematical model and that observed numerically or experimentally in glassy systems.