A new cutoff criterion for non-negatively curved chains
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916577894465536 |
|---|---|
| author | Pedrotti, Francesco Salez, Justin |
| author_facet | Pedrotti, Francesco Salez, Justin |
| contents | The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carré du champ operator, which is specific to differential generators and hence fails on discrete spaces. In the present paper, we show that an approximate version of this chain rule in fact always holds, with an extra cost that depends on the log-Lipschitz regularity of the considered observable. As a consequence, we derive a new cutoff criterion for non-negatively curved chains on finite spaces. The latter allows us to recover, in a simple and unified way, a number of historical instances of cutoff that had been established through model-specific arguments. Emblematic examples include random walk on the hypercube, random transpositions, random walk on the multislice, or MCMC samplers for popular spin systems such as the Ising and Hard-core models on bounded-degree graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13079 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A new cutoff criterion for non-negatively curved chains Pedrotti, Francesco Salez, Justin Probability 60J27 The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carré du champ operator, which is specific to differential generators and hence fails on discrete spaces. In the present paper, we show that an approximate version of this chain rule in fact always holds, with an extra cost that depends on the log-Lipschitz regularity of the considered observable. As a consequence, we derive a new cutoff criterion for non-negatively curved chains on finite spaces. The latter allows us to recover, in a simple and unified way, a number of historical instances of cutoff that had been established through model-specific arguments. Emblematic examples include random walk on the hypercube, random transpositions, random walk on the multislice, or MCMC samplers for popular spin systems such as the Ising and Hard-core models on bounded-degree graphs. |
| title | A new cutoff criterion for non-negatively curved chains |
| topic | Probability 60J27 |
| url | https://arxiv.org/abs/2501.13079 |