A direct comparison between the mixing time of the interchange process with "few" particles and independent random walks

Abstract

We consider the interchange process with k particles ( IP(k)) on n-vertex hypergraphs in which each hyperedge e rings at rate re. When e rings, the particles occupying it are permuted according to a random permutation from some arbitrary law, where our only assumption is that IP(2) has uniform stationary distribution. We show that t mix IP(k)(ε)=Ob(t mix IP(2)(ε/k)), where t mix IP(i)(ε) is the ε total-variation mixing time of IP(i), provided that kn-2Rt mix IP(2)(ε/k)=O((ε/k)b) for some b>0, where R=Σe re|e|(|e|-1) is n(n-1) times the particle-particle interaction rate at equilibrium. This has some consequences concerning the validity in this regime of conjectures of Oliveira about comparison of the ε mixing time of IP(k) to that of k independent particles, each evolving according to IP(1), denoted RW(k), and of Caputo about comparison of the spectral-gap of IP(k) to that of a single particle IP(1)= RW(1). We also show that t mixIP(k)(ε) t mix RW(1)(ε) t mix RW(k)(ε k/4) for all k n1-(1) and all ε 1k 14 for vertex-transitive graphs of constant degree, as well as for general graphs satisfying a mild ("transience-like") heat-kernel condition. In the case where the particles occupying a hyperedge e are permuted uniformly at random when e rings we obtain results bounding the spectral gap of IP(k) in terms of that RW(1). The proof does not use Morris' chameleon process. It can be seen as a rigorous and direct way of arguing that when the number of particles is fairly small, the system behaves similarly to k independent particles.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…