Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.0760

Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs

Sujay Sanghavi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide variety of applications, there are relatively few theoretical guarantees of convergence and correctness for general loopy graphs that may have many short cycles. Of these, even fewer provide exact ``necessary and sufficient'' characterizations. In this paper we investigate the problem of using max-product to find the maximum weight matching in an arbitrary graph with edge weights. This is done by first constructing a probability distribution whose mode corresponds to the optimal matching, and then running max-product. Weighted matching can also be posed as an integer program, for which there is an LP relaxation. This relaxation is not always tight. In this paper we show that \begin{enumerate} \item If the LP relaxation is tight, then max-product always converges, and that too to the correct answer. \item If the LP relaxation is loose, then max-product does not converge. \end{enumerate} This provides an exact, data-dependent characterization of max-product performance, and a precise connection to LP relaxation, which is a well-studied optimization technique. Also, since LP relaxation is known to be tight for bipartite graphs, our results generalize other recent results on using max-product to find weighted matchings in bipartite graphs.

Explore related subjects

cs.ITcs.AIcs.LGcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sujay Sanghavi. 2007-05-05. Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs. https://arxiv.org/abs/0705.0760

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, enabling innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results reveal a deterministic-random trade-off: the deterministic pilots enhance detection through a target-induced mean shift, while the random data payloads provide an additional covariance-domain target signature but simultaneously introduce statistical uncertainty due to their unknown realizations. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploit the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

Second-Order Schalkwijk-Kailath Coding for Autoregressive Gaussian Channels

We study noiseless-feedback communication over Gaussian channels with stationary autoregressive (AR) noise of arbitrary finite order. We introduce a class of Gaussian linear-feedback coding schemes based on the celebrated Schalkwijk--Kailath (SK) coding scheme, called SK(2), whose message process follows a second-order deterministic recursion, and derive a closed-form characterization of its maximal achievable rate under average power constraint $P$. As a first-order benchmark, we formulate SK(1) as a sign-consistent, branch-complete version of the real constant signed-ratio specialization of Butman's linear-feedback construction. For stationary AR($p$) Gaussian channels, optimizing over recursions with both characteristic roots outside the unit circle gives the same rate supremum as optimizing over all SK(2) recursions and yields a rate no smaller than the maximal SK(1) rate. The SK(2) scheme achieves feedback capacity for the AWGN channel, stationary AR(1) Gaussian channels, and a subclass of stationary AR(2) Gaussian channels obtained by interleaving two independent AR(1) noise processes. For the interleaved subclass, we show that a genuine SK(2) scheme strictly outperforms SK(1). Numerical comparisons illustrate further strict rate gains over a broader range of AR(2) parameters. These results show that the SK(1) scheme is not universally optimal beyond AR(1) noise and disprove a corrected form of Butman's conjecture.

cs.IT↗
arXiv2026

Computing the entropy rate of a quantized stationary Gaussian process

The entropy rate of a uniformly quantized stationary Gaussian process is the fundamental limit on its lossless compression. It has no closed form, and the classical high-resolution approximation breaks down whenever the spectral density is small on part of the band, as routine smoothing and filtering produce. Here we present two methods for computing the rate. The first is an analytical approximation, obtained from an exact dithering identity and the Kolmogorov-Szegő formula, in which the quantization noise power acts as a floor on the spectral density. The second is a Monte Carlo estimate of the exact rate: a minimum-phase moving-average representation makes the quantized sequence a hidden Markov process whose optimal particle filter is available in closed form, and the filter's log-likelihood on one long sequence gives the rate. The approximation agrees with the estimate to within a few millibits per sample over most of the parameter range for quantization steps up to the signal standard deviation, including processes on which the classical formula fails; for coarser steps the estimate should be used instead. At a step of a quarter of the standard deviation, linear predictive coding comes within 2 to 4 percent of the rate, FLAC within 3 to 32 percent, and general-purpose compressors remain 12 to 89 percent above it.

cs.IT↗