Rapid mixing of Gibbs sampling on graphs that are sparse on average
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Reconstruction for the Potts model
Proceedings of the forty-first annual ACM symposium on Theory of computing
Influence in a large society: interplay between information dynamics and network structure
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rumor centrality: a universal source detector
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given "far away' observations. Several theoretical results (and simple algorithms) are available when their joint probability distribution is Markov with respect to a tree. In this paper we consider the case of sequences of random graphs that converge locally to trees. In particular, we develop a sufficient condition for the tree and graph reconstruction problem to coincide. We apply such condition to colorings of random graphs. Further, we characterize the behavior of Ising models on such graphs, both with attractive and random interactions (respectively, "ferromagnetic' and "spin glass').