On the total variation distance of labelled Markov chains

DOI10.1145/2603088.2603099zbMath1395.68202arXiv1405.2852OpenAlexW2016370813MaRDI QIDQ4635617

Stefan Kiefer, Taolue Chen

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

zbMATH Keywords

total variation distancelabelled Markov chains

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (12)

Accurate approximate diagnosis of (controllable) stochastic systems ⋮ Converging from branching to linear metrics on Markov chains ⋮ Probabilistic verification of diagnosability for a certain class of timed stochastic systems ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ On Computing the Total Variation Distance of Hidden Markov Models. ⋮ Asymmetric Distances for Approximate Differential Privacy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the metric-based approximate minimization of Markov chains ⋮ A tale of two diagnoses in probabilistic systems ⋮ A probabilistic calculus of cyber-physical systems

This page was built for publication: On the total variation distance of labelled Markov chains