Cutoff phenomenon for the simple exclusion process on the complete graph

zbMATH Open1276.60005arXiv1010.4866MaRDI QIDQ2863704FDOQ2863704

Authors: Hubert Lacoin, Rémi Leblond 

Publication date: 3 December 2013

Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Abstract: We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order (n/2)log min(k, sqrt{n}), and that around this time, for any small positive epsilon the total variation distance drops from 1-epsilon to epsilon in a time window whose width is of order n (i.e. in a much shorter time). Our proof is purely probabilistic and self-contained.

Full work available at URL: https://arxiv.org/abs/1010.4866

Recommendations

• Cutoff phenomena for random walks on random regular graphs
• Cutoff phenomenon for random walks on Kneser graphs
• The cutoff profile for the simple exclusion process on the circle
• Cutoff for random walk on dynamical Erdős-Rényi graph
• Cutoff for nonbacktracking random walks on sparse random graphs
• scientific article; zbMATH DE number 7662445
• The cutoff phenomenon in finite Markov chains.
• scientific article; zbMATH DE number 1278106
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs

zbMATH Keywords

cutoffmixing timeexclusion process

Mathematics Subject Classification ID

Convergence of probability measures (60B10) Ergodicity, mixing, rates of mixing (37A25) Interacting particle systems in time-dependent statistical mechanics (82C22)

Cited In (16)

• Title not available (Why is that?)
• Universality of cutoff for exclusion with reservoirs
• Cutoff for the averaging process on the hypercube and complete bipartite graphs
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Exponentially slow mixing and hitting times of rare events for a reaction-diffusion model
• Mixing time and cutoff for the weakly asymmetric simple exclusion process
• The mixing time for simple exclusion
• The exclusion process mixes (almost) faster than independent particles
• The spectrum and convergence rates of exclusion and interchange processes on the complete graph
• Cutoff for the mean-field zero-range process
• The cutoff profile for the simple exclusion process on the circle
• The simple exclusion process on the circle has a diffusive cutoff window
• Mixing of the averaging process and its discrete dual on finite-dimensional geometries
• Limit profiles for projections of random walks on groups
• A sharp log-Sobolev inequality for the multislice
• Mixing time and cutoff for one-dimensional particle systems

This page was built for publication: Cutoff phenomenon for the simple exclusion process on the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863704)