title: Marathon: An Open Source Software Library for the Analysis of Markov-Chain Monte Carlo Algorithms.
abstract: We present the software library marathon, which is designed to support the analysis of sampling algorithms that are based on the Markov-Chain Monte Carlo principle. The main application of this library is the computation of properties of so-called state graphs, which represent the structure of Markov chains. We demonstrate applications and the usefulness of marathon by investigating the quality of several bounding methods on four well-known Markov chains for sampling perfect matchings and bipartite graphs. In a set of experiments, we compute the total mixing time and several of its bounds for a large number of input instances. We find that the upper bound gained by the famous canonical path method is often several magnitudes larger than the total mixing time and deteriorates with growing input size. In contrast, the spectral bound is found to be a precise approximation of the total mixing time.
authors.affiliation: Institute of Computer Science, Martin Luther University Halle-Wittenberg, Halle (Saale), Germany.
authors.forename: Steffen
authors.initials: S
authors.lastname: Rechner
authors.affiliation: Institute of Computer Science, Martin Luther University Halle-Wittenberg, Halle (Saale), Germany.|German Centre of Integrative Biodiversity Research (idiv) Halle-Jena-Leipzig, Leipzig, Germany.
authors.forename: Annabell
authors.initials: A
authors.lastname: Berger
mesh_terms: D000465:Algorithms; D046609:Libraries, Digital; D008390:Markov Chains; D009010:Monte Carlo Method; D012984:Software