The hardcore model is a model of lattice gas systems which has received much attention in
statistical physics, probability theory and theoretical computer science. It is the probability …

The noisiness of a channel can be measured by comparing suitable functionals of the input
and output distributions. For instance, the worst case ratio of output relative entropy to input …

Many problems of interest in computer science and information theory can be phrased in
terms of a probability distribution over discrete variables associated to the vertices of a large …

These inequalities can be tightened to produce" strong" data processing inequalities
(SDPIs), which are obtained by introducing appropriate channel-dependent or source …

Random instances of constraint satisfaction problems (CSPs) appear to be hard for all
known algorithms when the number of constraints per variable lies in a certain interval …

Reconstruction problems have been studied in a number of contexts including biology,
information theory and statistical physics. We consider the reconstruction problem for …

We study a system of simple random walks on T_d,n=(\calV_d,n,\calE_d,n), the d-ary tree of
depth n, known as the frog model. Initially there are Pois (λ) particles at each site …

We study the following generalization of the wellknown model of broadcasting on trees.
Consider an infinite directed acyclic graph (DAG) with a unique source vertex X. Let the …

We study Markov chains for randomly sampling k-colorings of a graph with maximum degree
δ. Our main result is a polynomial upper bound on the mixing time of the single-site update …

We consider the problem of doing fast and reliable estimation of the number z of non-zero
entries in a sparse boolean matrix product. This problem has applications in databases and …