I'm wondering if anybody has followed up on Nair/Tetali's correlation decay tree construction for hypergraphs. I didn't find anything relevant in back-citation on google scholar. Interesting question are:
- applying it to exact and approximate inference in Boltzmann machines, and
- using it to determine for which hypergraphs it is tractable to count the number of colorings approximately.