English

Cutoff for congestion dynamics and related generalized exclusion processes

Probability 2025-02-11 v1 Discrete Mathematics

Abstract

We consider congestion dynamics with nn players and QQ resources under the constraint that the number of each resource is κ\kappa and that n<κQn<\kappa Q in the regime that nn and κ\kappa diverge but QQ is fixed with n=ρκQn=\lfloor{\rho \kappa Q\rfloor} for a fixed constant ρ(0,1/2]\rho \in (0, 1/2]. We show that the Glauber dynamics and its unlabeled version exhibit cutoff at time (1/2)nlogn(1/2)n \log n and (1/2)(1ρ)nlogn(1/2)(1-\rho)n\log 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.

Keywords

Cite

@article{arxiv.2502.06071,
  title  = {Cutoff for congestion dynamics and related generalized exclusion processes},
  author = {Ryokichi Tanaka},
  journal= {arXiv preprint arXiv:2502.06071},
  year   = {2025}
}

Comments

31 pages, 2 figures

R2 v1 2026-06-28T21:37:59.341Z