Cover Image

Understanding the ratio of the partition sum to its Bethe approximation via double covers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vontobel, Pascal O.
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, et al.
Published: (2026)

Degree-$M$ Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix
by: Huang, Yuwen, et al.
Published: (2023)

Complex-Valued-Matrix Permanents: SPA-based Approximations and Double-Cover Analysis
by: Zhou, Junda, et al.
Published: (2026)

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs
by: Huang, Yuwen, et al.
Published: (2025)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
by: Bresler, Guy, et al.
Published: (2025)

Entropy of Exchangeable Random Graphs
by: Skeja, Anda, et al.
Published: (2023)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
by: Skeja, Anda, et al.
Published: (2024)

Community detection with the Bethe-Hessian
by: Stephan, Ludovic, et al.
Published: (2024)

Efficient computation of complementary set partitions, with applications to an extension and estimation of generalized cumulants
by: Di Nardo, Elvira, et al.
Published: (2025)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

One-weight codes in the sum-rank metric
by: Mushrraf, Usman, et al.
Published: (2025)

On the non-existence of perfect codes in the sum-rank metric
by: Del Prete, Giuseppe, et al.
Published: (2025)

Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory
by: Cao, Michael X., et al.
Published: (2019)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
by: Abiad, Aida, et al.
Published: (2026)

Sharp regret-Hellinger bounds for Gaussian empirical Bayes via polynomial approximation
by: Chen, Jiafeng, et al.
Published: (2026)

On integer partitions and the Wilcoxon rank-sum statistic
by: Sills, Andrew V.
Published: (2024)

Explicit Universal Bounds for Cumulants via Moments
by: Zhang, Jiechen
Published: (2025)

A leave-one-out approach to approximate message passing
by: Bao, Zhigang, et al.
Published: (2023)

Gaussian random projections of convex cones: approximate kinematic formulae and applications
by: Han, Qiyang, et al.
Published: (2022)

Semidefinite lower bounds for covering codes
by: Gijswijt, Dion, et al.
Published: (2025)

On the best approximation by finite Gaussian mixtures
by: Ma, Yun, et al.
Published: (2024)

Improved Bounds on the Probability of a Union and on the Number of Events that Occur
by: Adler, Ilan, et al.
Published: (2025)

Bounds on the Number of Modes of a Gaussian Mixture Density
by: Nguyen, Hien Duy
Published: (2026)

Rigidity theory in statistical inference
by: Bernstein, Daniel Irving
Published: (2026)

Multiplexons: Limits of Multiplex Networks
by: Ganguly, Ankan, et al.
Published: (2025)

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
by: Heering, Philipp, et al.
Published: (2026)

Cluster expansion of the log-likelihood ratio: Optimal detection of planted matchings
by: Wee, Timothy L. H., et al.
Published: (2025)

Information Inequalities via Ideas from Additive Combinatorics
by: Lau, Chin Wa, et al.
Published: (2023)

Construction of extremal Type II $\mathbb{Z}_{8}$-codes via doubling method
by: Ban, Sara, et al.
Published: (2024)

Congruences for spin characters of the double covers of the symmetric and alternating groups
by: Nath, Rishi, et al.
Published: (2015)

Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
by: Jakhar, Gunank, et al.
Published: (2026)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
by: Ishizuka, Keita
Published: (2026)

Anytime-Valid Quantum State Tomography via Confidence Sequences
by: Cumitini, Aldo, et al.
Published: (2026)

Causal Models for Growing Networks
by: Bravo-Hermsdorff, Gecia, et al.
Published: (2025)