The cutoff profile for exclusion processes in any dimension
Joe P. Chen

TL;DR
This paper establishes the precise cutoff profile for symmetric exclusion processes on various graphs converging to metric spaces, identifying the cutoff time and describing the limiting total variation profile using an analytic approach.
Contribution
It proves the cutoff phenomenon and its profile for exclusion processes on general spaces, introducing cutoff semimartingales and employing the entropy method for analysis.
Findings
Cutoff occurs at time t_N = log|V_N| / (2λ_1^N).
The total variation profile converges to a limit described by Brownian motion.
Results hold on Euclidean lattices and fractal spaces.
Abstract
Consider symmetric simple exclusion processes, with or without Glauber dynamics on the boundary set, on a sequence of connected unweighted graphs which converge geometrically and spectrally to a compact connected metric measure space. Under minimal assumptions, we prove not only that total variation cutoff occurs at times , where is the cardinality of , and is the lowest nonzero eigenvalue of the nonnegative graph Laplacian; but also the limit profile for the total variation distance to stationarity. The assumptions are shown to hold on the -dimensional Euclidean lattices for any , as well as on self-similar fractal spaces. Our approach is decidedly analytic and does not use extensive coupling arguments. We identify a new observable in the exclusion process -- the cutoff semimartingales -- obtained…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Distributed systems and fault tolerance · Advanced Queuing Theory Analysis
