A quantitative central limit theorem for the simple symmetric exclusion process
Benjamin Gess, Vitalii Konarovskyi

TL;DR
This paper proves a quantitative central limit theorem for the simple symmetric exclusion process on a discrete torus, establishing optimal convergence rates by comparing generators and using Berry-Essen bounds.
Contribution
It introduces a novel approach to quantify the convergence rate of the SSEP to a Gaussian process, improving upon previous qualitative results.
Findings
Optimal rate of convergence established
Generator comparison technique developed
Berry-Essen bounds applied in infinite dimensions
Abstract
A quantitative central limit theorem for the simple symmetric exclusion process (SSEP) on a -dimensional discrete torus is proven. The argument is based on a comparison of the generators of the density fluctuation field of the SSEP and the generalized Ornstein-Uhlenbeck process, as well as on an infinite-dimensional Berry-Essen bound for the initial particle fluctuations. The obtained rate of convergence is optimal.
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 · Random Matrices and Applications · Advanced Thermodynamics and Statistical Mechanics
