Cutoff for congestion dynamics and related generalized exclusion processes
Abstract
We consider congestion dynamics with n players and Q resources under the constraint that the number of each resource is and that n< Q in the regime that n and diverge but Q is fixed with n= Q for a fixed constant ∈ (0, 1/2]. We show that the Glauber dynamics and its unlabeled version exhibit cutoff at time (1/2)n n and (1/2)(1-)n n in total variation respectively. The unlabeled version is a special case of natural Markov chains for sampling from log M-concave distributions. We also show that a family of Markov chains for uniform sampling on M-convex sets does not necessarily exhibit cutoff.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.