Shuffling cards by spatial motion
Abstract
We propose a model of card shuffling where a pack of cards, spread as points on a square table, are repeatedly gathered locally at random spots and then spread towards a random direction. A shuffling of the cards is then obtained by arranging the cards by their increasing x-coordinate values. When there are m cards on the table we show that this random ordering gets mixed in time O( m). Explicit constants are evaluated in a diffusion limit when the position of m cards evolves as an interesting 2m-dimensional non-reversible reflected jump diffusion in time. Our main technique involves the use of multidimensional Skorokhod maps for double reflections in [0,1]2 in taking the discrete to continuous limit. The limiting computations are then based on the planar Brownian motion and properties of Bessel processes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.