Given a finite graph, we consider the random permutation given by the product of
transpositions of neighbouring vertices. The main question deals with the distribution
of cycle lengths. I will review rigorous results for the complete graph, for trees, for
the hypercube, as well as numerical results for large cubes. I will also discuss a
variant of the model that is related to quantum spin systems.