Reconstruction for models on random graphs

Details Reconstruction for models on random graphs Reconstruction for models on random graphs

2007-04-25

arxiv.org/abs/0704.3293v2

Mathematics

Probability

16 pages

Scientific paper

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').

Affiliated with

Also associated with

No associations

Rating

Reconstruction for models on random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reconstruction for models on random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstruction for models on random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707075