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

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples
include random regular graphs with bounded degree and uniformly random graphs with …

We consider the computation of the volume of the union of high-dimensional geometric
objects. While showing that this problem is# P-hard already for very simple bodies, we give …

Consider an information source generating a symbol at the root of a tree network whose
links correspond to noisy communication channels, and broadcasting it through the network …

We construct a deterministic fully polynomial time approximationscheme (FPTAS) for
computing the total number of matchings in abounded degree graph. Additionally, for an …

We consider homogeneous factor models on uniformly sparse graph sequences converging
locally to a (unimodular) random tree T, and study the existence of the free energy density ϕ …

A voter sits on each vertex of an infinite tree of degree k, and has to decide between two
alternative opinions. At each time step, each voter switches to the opinion of the majority of …

Optimization is fundamental in many areas of science, from computer science and
information theory to engineering and statistical physics, as well as to biology or social …

We prove that the two-dimensional Schelling segregation model yields monochromatic
regions of size exponential in the area of individuals' neighborhoods, provided that the …

We present a framework for obtaining fully polynomial time approximation schemes
(FPTASs) for stochastic univariate dynamic programs with either convex or monotone single …