Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.10119

Approximate Colorwise Tensorization of Entropy and Optimal Mixing of the Wang-Swendsen-Koteck\'y Dynamics

Chunyang Wang·Yuichi Yoshida·Zihan Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the mixing time of Wang-Swendsen-Koteck\'{y} (WSK) dynamics for uniformly sampling proper $q$-colorings. The WSK dynamics is widely used in statistical physics for sampling from the antiferromagnetic Potts model and can be considered a global counterpart of the flip dynamics, which currently yields the state-of-the-art bounds for sampling colorings in general graphs (Carlson and Vigoda, SODA 2025). However, despite its importance, the tools for analyzing such dynamics remain limited. We develop new tools that enable us to analyze the mixing time of the WSK dynamics through the lens of relative entropy contraction. We introduce new criteria for multi-spin distributions: approximate colorwise tensorization of entropy (ACTE) and approximate colorwise subadditivity of entropy (ACSE). These criteria provide a colorwise counterpart to standard vertex-wise entropy factorization principles, and expose a form of color symmetry beyond coordinate-wise analyses. We also develop new inductive approaches for establishing such criteria on specific types of graphs, which can be viewed as local-to-global arguments for proving high-dimensional functional inequalities in a graph-theoretic sense. As concrete applications, we establish an optimal $O_q(\log n)$ mixing time for the WSK dynamics on chordal and outerplanar graphs, down to the optimal number of colors. Because trees and line graphs of trees are chordal, the result covers both vertex and edge colorings of trees. Our results work in a regime that bypasses the irreducibility threshold for Glauber dynamics while also improving the best known mixing time bounds (Carlson, Chen, Feng and Vigoda, SODA 2025).

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Chunyang Wang, Yuichi Yoshida, Zihan Zhang. 2026-07-11. Approximate Colorwise Tensorization of Entropy and Optimal Mixing of the Wang-Swendsen-Koteck\'y Dynamics. https://arxiv.org/abs/2607.10119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗