arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.12541math.STstat.TH
收藏

局部独立图的弱等价性

Weak equivalence of local independence graphs

Søren Wengel Mogensen

摘要:

多元随机向量的经典图形建模使用图形来编码条件独立性。在多变量随机过程的图形建模中,图可以类似地编码所谓的局部独立性。如果多变量随机过程的某些坐标过程是不可观测的,则可观测的坐标过程的局部独立图是有向混合图(DMG)。两个DMG可以编码相同的局部独立性,在这种情况下,我们说它们是马尔可夫等价的。马尔可夫等价是图形建模中的一个核心概念。我们发现,决定马尔可夫等价的DMG是NP完全的,即使在稀疏性假设。作为一种补救措施,我们引入了一个集合的等价关系的DMG都是粒度小于马尔可夫等价,我们说,他们是弱等价关系。这导致可行的算法自然发生的计算问题有关的弱等价DMG。弱等价关系的等价类具有吸引性质。特别地,每个等价类具有导致等价类的简明表示的最大元素。此外,这些等价关系定义了图形建模中的粒度层次,这导致对应于不同粒度级别的等价关系之间的简单且可解释的连接。

英文摘要:

Classical graphical modeling of multivariate random vectors uses graphs to encode conditional independence. In graphical modeling of multivariate stochastic processes, graphs may encode so-called local independence analogously. If some coordinate processes of the multivariate stochastic process are unobserved, the local independence graph of the observed coordinate processes is a directed mixed graph (DMG). Two DMGs may encode the same local independences in which case we say that they are Markov equivalent. Markov equivalence is a central notion in graphical modeling. We show that deciding Markov equivalence of DMGs is coNP-complete, even under a sparsity assumption. As a remedy, we introduce a collection of equivalence relations on DMGs that are all less granular than Markov equivalence and we say that they are weak equivalence relations. This leads to feasible algorithms for naturally occurring computational problems related to weak equivalence of DMGs. The equivalence classes of a weak equivalence relation have attractive properties. In particular, each equivalence class has a greatest element which leads to a concise representation of an equivalence class. Moreover, these equivalence relations define a hierarchy of granularity in the graphical modeling which leads to simple and interpretable connections between equivalence relations corresponding to different levels of granularity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑