Research
Statistical physics, provided powerful insights into the theory of combinatorial structures and algorithms. For example, the success of certain counting algorithms is well known to be linked with the phase transition properties of the underlying…
It is well-known that any Boolean function f:-1,+1n to -1,+1 can be written uniquely as a polynomial f(x) = sumS subset [n] fs prodi in S xi. The collection of coefficients (fS’s) this expression are…
Notions of entropy and information, pioneered by Shannon, have been very powerful tools in coding theory. Coding theory aims to solve the problem of one-way communication: sending a message from Alice to Bob using as…
The reconstruction problem on the tree concerns the propagation of information in Markov processes on trees and has been studied in probability, statistical physics, computational biology, information theory and theoretical computer science. I will discuss…
