Skip to content
DraconiticResearch
Search Sources API
186,631 studies31 sourcesUpdated 37 min ago
PreprintarXiv licencearXiv

Optimal mixing of the systematic scan dynamics via approximate tensorization of entropy

Abstract

We study the mixing time of the systematic scan dynamics for high-dimensional discrete distributions. This Markov chain updates coordinates sequentially according to a fixed predetermined order, in contrast to the Glauber dynamics that updates coordinates selected uniformly at random. The systematic scan is often favored in practice because it exhibits strong empirical performance, but its theoretical analysis remains far less developed than that of Glauber dynamics. We take a step toward addressing this imbalance by showing that two standard functional notions of weak dependence between the coordinates of the distribution provide strong convergence guarantees for the systematic scan dynamics. First, we show that approximate tensorization of entropy implies optimal O(log n) mixing time for every scan order under standard marginal, connectivity, and bounded interaction degree assumptions about the distribution. Second, we show that approximate tensorization of variance yields a constant-factor contraction of the variance functional per scan, which in turn implies an optimal O(1) relaxation time for the natural additive and multiplicative reversibilizations of the systematic scan dynamics. Compared with our entropy result, the variance bound improves the dependence on the maximum interaction degree from exponential to quadratic and requires weaker assumptions on the distribution. As concrete applications of our results, we establish optimal O(log n) mixing of the systematic scan dynamics for bounded-degree antiferromagnetic two-spin systems in the tree-uniqueness region and for the ferromagnetic q-state Potts model on square boxes in ℤ2 throughout its subcritical regime.

Related

  1. Near-Optimal Complexity of Finding Approximate Local Minima of Nonconvex Finite Sums
    Qihao Zhou
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Quantum thermalization achieves optimal approximate quantum error correction
    Aditi Venkatesh, Richard R. Allen, Saúl Pilatowsky-Cameo +2
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  3. Optimal von Neumann Entropy Estimation
    Ziyun Chen, Minbo Gao, Qisheng Wang
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control
    Italo Napolitano, Mario di Bernardo
    arXivPreprintCC BY-NC-SA 4.0Full textOptimisation & controlarXiv
  5. Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
    Long Chen, Zeyi Xu
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{blanca2026optimal,
  title = {{Optimal mixing of the systematic scan dynamics via approximate tensorization of entropy}},
  author = {Antonio Blanca and Md Tahmidur Rafid},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.05750},
  eprint = {2609.05750},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.05750},
}
RIS
TY  - UNPB
TI  - Optimal mixing of the systematic scan dynamics via approximate tensorization of entropy
AU  - Antonio Blanca
AU  - Md Tahmidur Rafid
PY  - 2026
DA  - 2026/09/04
PB  - arXiv
DO  - 10.48550/arxiv.2609.05750
UR  - https://arxiv.org/abs/2609.05750
AB  - We study the mixing time of the systematic scan dynamics for high-dimensional discrete distributions. This Markov chain updates coordinates sequentially according to a fixed predetermined order, in contrast to the Glauber dynamics that updates coordinates selected uniformly at random. The systematic scan is often favored in practice because it exhibits strong empirical performance, but its theoretical analysis remains far less developed than that of Glauber dynamics. We take a step toward addressing this imbalance by showing that two standard functional notions of weak dependence between the coordinates of the distribution provide strong convergence guarantees for the systematic scan dynamics. First, we show that approximate tensorization of entropy implies optimal O(log n) mixing time for every scan order under standard marginal, connectivity, and bounded interaction degree assumptions about the distribution. Second, we show that approximate tensorization of variance yields a constant-factor contraction of the variance functional per scan, which in turn implies an optimal O(1) relaxation time for the natural additive and multiplicative reversibilizations of the systematic scan dynamics. Compared with our entropy result, the variance bound improves the dependence on the maximum interaction degree from exponential to quadratic and requires weaker assumptions on the distribution. As concrete applications of our results, we establish optimal O(log n) mixing of the systematic scan dynamics for bounded-degree antiferromagnetic two-spin systems in the tree-uniqueness region and for the ferromagnetic q-state Potts model on square boxes in ℤ^2 throughout its subcritical regime.
ER  -