English
Related papers

Related papers: Double-Cover-Based Analysis of the Bethe Permanent…

200 papers

The permanent of a non-negative matrix appears naturally in many information processing scenarios. Because of the intractability of the permanent beyond small matrices, various approximation techniques have been developed in the past. In…

Combinatorics · Mathematics 2022-05-31 Kit Shing Ng , Pascal O. Vontobel

It has recently been observed that the permanent of a non-negative square matrix, i.e., of a square matrix containing only non-negative real entries, can very well be approximated by solving a certain Bethe free energy function minimization…

Information Theory · Computer Science 2015-03-19 Pascal O. Vontobel

Approximating the permanent of a complex-valued matrix is a fundamental problem with applications in Boson sampling and probabilistic inference. In this paper, we extend factor-graph-based methods for approximating the permanent of…

Information Theory · Computer Science 2026-01-27 Junda Zhou , Pascal O. Vontobel

The permanent of a non-negative square matrix can be well approximated by finding the minimum of the Bethe free energy functions associated with some suitably defined factor graph; the resulting approximation to the permanent is called the…

Combinatorics · Mathematics 2024-05-29 Yuwen Huang , Navin Kashyap , Pascal O. Vontobel

Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases…

Information Theory · Computer Science 2016-07-06 Pascal O. Vontobel

For various classes of graphical models it has been observed that the ratio of the partition sum to its Bethe approximation is often close to being the square of the ratio of the partition sum to its degree-2 Bethe approximation. This is of…

Information Theory · Computer Science 2025-09-25 Pascal O. Vontobel

We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of $\sqrt{2}^n$ in polynomial time, improving upon the previous deterministic approximations. We show this by proving that the Bethe…

Data Structures and Algorithms · Computer Science 2019-12-11 Nima Anari , Alireza Rezaei

It was recently conjectured that a vector with components equal to the Bethe permanent of certain submatrices of a parity-check matrix is a pseudocodeword. In this paper we prove a stronger version of this conjecture for some important…

Information Theory · Computer Science 2013-05-22 Roxana Smarandache

In this thesis, we leverage finite graph covers to analyze the SPA and the Bethe partition function for both S-FGs and DE-FGs. There are two main contributions in this thesis. The first main contribution concerns a special class of S-FGs…

Information Theory · Computer Science 2024-12-10 Yuwen Huang

We present an efficient algorithm for computing the permanent for matrices of size N that can written as a product of L block diagonal matrices with blocks of size at most 2. For fixed L, the time and space resources scale linearly in N,…

Discrete Mathematics · Computer Science 2012-09-03 Kristan Temme , Pawel Wocjan

It was recently conjectured that the permanent of a ${P}$-lifting $\theta^{\uparrow{P}}$ of a matrix $\theta$ of degree $M$ is less than or equal to the $M$th power of the permanent perm$(\theta)$, i.e.,…

Information Theory · Computer Science 2015-03-10 Roxana Smarandache , Martin Haenggi

Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…

Computational Complexity · Computer Science 2018-10-12 Ranveer Singh , Vivek Vijay , RB Bapat

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization…

Information Theory · Computer Science 2013-11-05 Pascal O. Vontobel

This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…

Statistics Theory · Mathematics 2021-09-14 Ben O'Neill

We consider the set Bp of parametric block correlation matrices with p blocks of various (and possibly different) sizes, whose diagonal blocks are compound symmetry (CS) correlation matrices and off-diagonal blocks are constant matrices.…

Statistics Theory · Mathematics 2017-05-30 O Roustant , Y Deville

The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain…

Combinatorics · Mathematics 2022-09-30 Zhenzhen Lou , Nobuaki Obata , Qiongxiang Huang

Optical properties of materials related to light absorption and scattering are explained by the excitation of electrons. The Bethe-Salpeter equation is the state-of-the-art approach to describe these processes from first principles (ab…

Numerical Analysis · Mathematics 2020-08-21 Peter Benner , Carolin Penke

Currently, components of consistent mass matrix are computed using various numerical integration schemes, each one alters in number of integration (Gauss) points, requires different amount of computations and possess different level of…

Numerical Analysis · Mathematics 2014-11-06 Eli Hanukah

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…

Optimization and Control · Mathematics 2023-03-21 Luis Felipe Vargas , Monique Laurent
‹ Prev 1 2 3 10 Next ›