关于标号马氏链的全变差距离
On the Total Variation Distance of Labelled Markov Chains
摘要:
标记马尔可夫链广泛应用于概率验证、语音识别、计算生物学等领域。检查两个LMC的等价性是一个经典的问题,受到广泛的研究,而总变异距离提供了一个自然的措施,“不等价”的两个LMC:它是最大的差异概率LMC分配给同一事件。本文提出了两个LMC之间的总变差距离的理论,着重于算法方面:(1)给出了一个确定两个LMC之间是否有距离1的多项式时间算法,即,它们是否几乎总是可以区分的;(2)我们提供了一种算法,用于以任意精度近似距离;以及(3)我们表明阈值问题,即,距离是否超过给定的阈值,是NP-难的,并且对于平方根和问题是困难的。我们还建立了总变差距离和伯努利卷积之间的联系。
英文摘要:
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the total variation distance provides a natural measure for the "inequivalence" of two LMCs: it is the maximum difference between probabilities that the LMCs assign to the same event. In this paper we develop a theory of the total variation distance between two LMCs, with emphasis on the algorithmic aspects: (1) we provide a polynomial-time algorithm for determining whether two LMCs have distance 1, i.e., whether they can almost always be distinguished; (2) we provide an algorithm for approximating the distance with arbitrary precision; and (3) we show that the threshold problem, i.e., whether the distance exceeds a given threshold, is NP-hard and hard for the square-root-sum problem. We also make a connection between the total variation distance and Bernoulli convolutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。