On Computing the Total Variation Distance of Hidden Markov Models.

DOI10.4230/LIPIcs.ICALP.2018.130zbMath1499.68146arXiv1804.06170OpenAlexW2963735614MaRDI QIDQ5002817

Stefan Kiefer

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1804.06170

zbMATH Keywords

complexitydistancedecidabilityhidden Markov modelslabelled Markov chains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convergence of probability measures (60B10)

Related Items (4)

Asymmetric Distances for Approximate Differential Privacy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• PRISM
• mctoolbox
• Storm

Cites Work

• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Stochastic models for heterogeneous DNA sequences
• The consensus string problem and the complexity of comparing hidden Markov models.
• On the Complexity of Computing Probabilistic Bisimilarity
• Polynomial Space Counting Problems
• On the definition of a family of automata
• PP is as Hard as the Polynomial-Time Hierarchy
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Biological Sequence Analysis
• On the total variation distance of labelled Markov chains
• Accuracy and Stability of Numerical Algorithms
• Probability and Computing

This page was built for publication: On Computing the Total Variation Distance of Hidden Markov Models.