Information theory and inference, often taught separately, are here united in one entertaining
textbook. These topics lie at the heart of many exciting areas of contemporary science and …

The formalism of probabilistic graphical models provides a unifying framework for capturing
complex dependencies among random variables, and building large-scale multivariate …

Important inference problems in statistical physics, computer vision, error-correcting coding
theory, and artificial intelligence can all be reformulated as the computation of marginal …

Let Fk (n, m) be a random k-SAT formula on n variables formed by selecting uniformly and
independently m out of all possible k-clauses. It is well-known that for r≥ 2k ln 2, Fk (n, rn) is …

It has been shown experimentally that a decimation algorithm based on survey propagation
(SP) equations allows one to solve efficiently some combinatorial problems over random …

A local search algorithm solving an NP-complete optimization problem can be viewed as a
stochastic process moving in an'energy landscape'towards eventually finding an optimal …

This dissertation studies relationships between fast convergence to equilibrium (mixing in
time) of natural Markov chain Monte Carlo algorithms for discrete spin systems, and decay of …

In this paper we generalize a heuristic that we have introduced previously for solving
efficiently random 3-SAT formulae. Our heuristic is based on the notion of backbone …

Why adiabatic quantum annealing is unlikely to yield speed-up - IOPscience This site uses
cookies. By continuing to use this site you agree to our use of cookies. To find out more, see …

Survey propagation is a powerful technique from statistical physics that has been applied to
solve the 3-SAT problem both in principle and in practice. We give, using only probability …