Maximum Kolmogorov-Sinai Entropy Versus Minimum Mixing Time in Markov Chains
Résumé
We establish a link between the maximization of Kolmogorov Sinai entropy (KSE)
and the minimization of the mixing time for general Markov chains. Since the maximisation of
KSE is analytical and easier to compute in general than mixing time, this link provides a new
faster method to approximate the minimum mixing time dynamics. It could be interesting in
computer sciences and statistical physics, for computations that use random walks on graphs
that can be represented as Markov chains.
Domaines
Physique [physics]| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...