Thomas Alun, Green Peter J
Department of Biomedical Informatics, University of Utah.
Comput Stat Data Anal. 2009 Feb 15;53(4):1232-1238. doi: 10.1016/j.csda.2008.10.029.
Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of this results to Markov chain Monte Carlo methods that sample or optimize over the space of decomposable graphical models according to probabilities determined by a posterior distribution given observed multivariate data.
给定一个可分解图，我们刻画并列举出这样的顶点对集合：其连接或断开会产生一个新的也是可分解的图。我们讨论了此结果与马尔可夫链蒙特卡罗方法的相关性，该方法根据给定观测多元数据的后验分布所确定的概率，在可分解图形模型的空间上进行采样或优化。
