跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2506.16250 · v3

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs

首次提交 2025-06-19 20:08
版本更新 2026-11-14 23:46
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

For standard factor graphs (S-FGs), whose local functions are nonnegative-real valued, a popular approximation of the partition function is given by the Bethe approximation, which is also known as the Bethe partition function. Vontobel gave a combinatorial characterization of the Bethe partition function with the help of graph covers. The proof of this characterization heavily relied on the method of types. In this paper, we study double-edge factor graphs (DE-FGs), whose local functions are complex valued and satisfy certain positive-semidefinite constraints. DE-FGs and their partition functions are particularly relevant to quantum information processing. Approximating the partition function of a DE-FG is more difficult than approximating the partition function of an S-FG because the DE-FG partition function is a sum of complex values rather than nonnegative-real values. We develop a Bethe approximation of the partition function of a DE-FG based on sum-product-algorithm (SPA) fixed points. However, one cannot directly apply the method of types to prove a similar graph-cover-based combinatorial characterization of the Bethe partition function as in the case of S-FGs. Despite this, we establish such a combinatorial characterization for a class of DE-FGs that satisfy an easily checkable condition. Towards proving this characterization, we apply a suitable loop-calculus transform (LCT) to DE-FGs. Originally, the LCT was introduced by Chertkov and Chernyak as a special linear transform for S-FGs and later extended by Mori. Our proposed LCT is applicable to both S-FGs and DE-FGs and generalizes prior versions by handling zero-valued SPA fixed-point message components, which are common in DE-FGs. Supported by numerical results, we conjecture that the graph-cover-based combinatorial characterization of the Bethe partition function holds more broadly for DE-FGs.

作者备注:arXiv admin note: substantial text overlap with arXiv:2412.05942

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-14 23:46 · 最新观测版本

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs

For standard factor graphs (S-FGs), whose local functions are nonnegative-real valued, a popular approximation of the partition function is given by the Bethe approximation, which is also known as the Bethe partition function. Vontobel gave a combinatorial characterization of the Bethe partition function with the help of graph covers. The proof of this characterization heavily relied on the method of types. In this paper, we study double-edge factor graphs (DE-FGs), whose local functions are complex valued and satisfy certain positive-semidefinite constraints. DE-FGs and their partition functions are particularly relevant to quantum information processing. Approximating the partition function of a DE-FG is more difficult than approximating the partition function of an S-FG because the DE-FG partition function is a sum of complex values rather than nonnegative-real values. We develop a Bethe approximation of the partition function of a DE-FG based on sum-product-algorithm (SPA) fixed points. However, one cannot directly apply the method of types to prove a similar graph-cover-based combinatorial characterization of the Bethe partition function as in the case of S-FGs. Despite this, we establish such a combinatorial characterization for a class of DE-FGs that satisfy an easily checkable condition. Towards proving this characterization, we apply a suitable loop-calculus transform (LCT) to DE-FGs. Originally, the LCT was introduced by Chertkov and Chernyak as a special linear transform for S-FGs and later extended by Mori. Our proposed LCT is applicable to both S-FGs and DE-FGs and generalizes prior versions by handling zero-valued SPA fixed-point message components, which are common in DE-FGs. Supported by numerical results, we conjecture that the graph-cover-based combinatorial characterization of the Bethe partition function holds more broadly for DE-FGs.

查看此版本解读 →查看此版本原文 ↗