Cutoff phenomenon for the simple exclusion process on the complete graph
From MaRDI portal
Publication:2863704
zbMath1276.60005arXiv1010.4866MaRDI QIDQ2863704
Publication date: 3 December 2013
Full work available at URL: https://arxiv.org/abs/1010.4866
Interacting particle systems in time-dependent statistical mechanics (82C22) Ergodicity, mixing, rates of mixing (37A25) Convergence of probability measures (60B10)
Related Items (8)
The spectrum and convergence rates of exclusion and interchange processes on the complete graph ⋮ Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ Unnamed Item ⋮ Exponentially slow mixing and hitting times of rare events for a reaction--diffusion model ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ Cutoff for the mean-field zero-range process ⋮ A sharp log-Sobolev inequality for the multislice
This page was built for publication: Cutoff phenomenon for the simple exclusion process on the complete graph
