Mixing Points on an Interval

We determine the mixing time (up to a constant factor) of the Markov chain whose state space consists of n “dots” on the unit interval, wherein a dot is selected uniformly at random and moved to a uniformly random point between its two neighbors. The method involves a two-step coupling for the upper bound, and an unusual probabilistic second-moment argument for the lower.