Metraipolis › archive › dc_12eaf029aaad

Linear time mixing and pre-cutoff for oriented kinetically constrained models — arXiv:2609.30585

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30585
License (as archived)
CC0-1.0
Archived
2026-10-08T02:57:36.708Z
SHA-256 of the archived text
0e9b52de57a258892c0add95c895fed95d5ac5cde1e12c81440420758b8c3cd6
Stable URL of this page
https://metraipolis.com/documento/dc_12eaf029aaad

How to cite

Linear time mixing and pre-cutoff for oriented kinetically constrained models — arXiv:2609.30585 — arXiv (en), https://arxiv.org/abs/2609.30585 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_12eaf029aaad (Metraipolis archive dc_12eaf029aaad, sha256 0e9b52de57a258892c0add95c895fed95d5ac5cde1e12c81440420758b8c3cd6)
BibTeX
@misc{dc12eaf029aaad,
  title = {Linear time mixing and pre-cutoff for oriented kinetically constrained models — arXiv:2609.30585},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30585},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_12eaf029aaad; sha256 0e9b52de57a258892c0add95c895fed95d5ac5cde1e12c81440420758b8c3cd6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30585. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We establish linear time precutoff for oriented kinetically constrained models (KCMs) on a $d$-dimensional box of side length $n$, whenever the finite-volume spectral gap is bounded away from zero uniformly in $n$. A typical example is the North-East model, a $0$-$1$ spin system on the two-dimensional integer lattice that evolves according to the following rule: whenever a site's southerly and westerly nearest neighbours have spin $0$, with rate one it resets its own spin by tossing a $(1-q)$-coin; at all other times its spin remains frozen. This settles, in the oriented case, a conjecture which states that there is linear time precutoff for all KCMs in the (open) ergodic parameter regime ($q>q_c$). The result has been shown recently, for general update families, in a perturbative regime ($q$ close to $1$). The previous general upper bound on the mixing time for oriented update families, in the full ergodic regime, was $O(n \log n)$. The proof combines a spectral estimate for a certain killed process with a graphical coupling to a stationary process and a backward witness path argument, exploiting the orientation of the constraints, to control the probability of failing to couple.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.30585 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T02:27:13.352Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).