Solvable Probabilistic Model for Cycles in Planar Graph

スポンサーリンク

概要

• 論文の詳細を見る

• We study a probabilistic model for single connected cycles on an undirected planar graph for which the degree of every vertex is restricted to two or three. By using a diagrammatical method to solve a free fermion model, we derive the exact expression of the partition function as well as marginal probabilities. We compare the exact results for the marginals with the approximations obtained with Loopy Belief Propagation allowing us to evaluate the efficacy of the latter.

• 東北大学の論文
• 2009-08-01

著者

• TANAKA Kazuyuki

  GSIS, Department of Computer and Mathematical Science, Tohoku University

• Van Kerrebroeck

  Smc-infm-cnr And Infn Sapienza Universita Di Roma

• KERREBROECK Valery

  SMC-INFM-CNR and INFN, Sapienza Universita di Roma

関連論文

• Image Segmentation Based on Bethe Approximation for Gaussian Mixture Model
• Solvable Probabilistic Model for Cycles in Planar Graph

スポンサーリンク