Reconstruction and Clustering in Random Constraint Satisfaction Problems

The families are general enough to include commonly studied problems such as, random instances of Not-All-Equal-SAT, $k$-XOR formulae, hypergraph 2-coloring, and graph $k$-coloring. This is joint work with Andrea Montanari (Stanford University) and Ricardo Restrepo (Georgia Tech.)