Maximum Kolmogorov-Sinai entropy vs minimum mixing time in Markov chains
Martin Mihelich, Berengere Dubrulle, Didier Paillard, Davide Faranda,, Quentin Kral

TL;DR
This paper proposes using Kolmogorov-Sinai entropy as a faster way to estimate the mixing time of Markov chains, linking entropy maximization to minimal mixing time, with implications for physics and computer science.
Contribution
It establishes a novel link between Kolmogorov-Sinai entropy maximization and the minimization of mixing time in Markov chains, offering a more efficient estimation method.
Findings
KSE maximization correlates with minimal mixing time.
New method provides faster approximation of mixing time.
Implications for selecting stationary states in physics.
Abstract
Many modern techniques employed in physics, such a computation of path integrals, rely on random walks on graphs that can be represented as Markov chains. Traditionally, estimates of running times of such sampling algorithms are computed using the number of steps in the chain needed to reach the stationary distribution. This quantity is generally defined as mixing time and is often difficult to compute. In this paper, we suggest an alternative estimate based on the Kolmogorov-Sinai entropy, by establishing a link between the maximization of KSE and the minimization of the mixing time. Since KSE are easier to compute in general than mixing time, this link provides a new faster method to approximate the minimum mixing time that could be interesting in computer sciences and statistical physics. Beyond this, our finding will also be of interest to the out-of-equilibrium community, by…
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
TopicsAdvanced Thermodynamics and Statistical Mechanics · Statistical Mechanics and Entropy · Gaussian Processes and Bayesian Inference
