The exclusion process mixes (almost) faster than independent particles
The Annals of Probability · 01.11.2020 · 48 (6) · 3077-3123
DOI: 10.1214/20-aop1455 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Annals of Probability, erschienen am 01.11.2020. Verfasst von Jonathan Hermon und 1 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 43 Literaturangaben.
Abstract (Originalsprache)
Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for $d$-regular graphs when each edge rings at rate $1/d$ in various cases: (1) when $d=\Omega (\log _{n/k}n)$, (2) when $\mathrm{gap}:=$ the spectral-gap of a single walk is $O(1/\log ^{4}n)$ and $k\ge n^{\Omega (1)}$, (3) when $k\asymp n^{a}$ for some constant $0
Zitieren
APA
Hermon, J., & Pymar, R. (2020). The exclusion process mixes (almost) faster than independent particles. The Annals of Probability, 48(6), 3077-3123. https://doi.org/10.1214/20-aop1455
Vancouver
Hermon J, Pymar R. The exclusion process mixes (almost) faster than independent particles. The Annals of Probability. 2020;48(6):3077-3123. doi:10.1214/20-aop1455
BibTeX
@article{Hermon2020,
author = {Hermon, Jonathan and Pymar, Richard},
title = {The exclusion process mixes (almost) faster than independent particles},
journal = {The Annals of Probability},
year = {2020},
volume = {48},
number = {6},
pages = {3077--3123},
doi = {10.1214/20-aop1455}
}
EUVIMED