Reconstruction thresholds on regular trees

Details Reconstruction thresholds on regular trees Reconstruction thresholds on regular trees

2003-05-28

arxiv.org/abs/math/0305400v1

Mathematics

Probability

12 pages

Scientific paper

We consider a branching random walk with binary state space and index set $T^k$, the infinite rooted tree in which each node has k children (also known as the model of "broadcasting on a tree"). The root of the tree takes a random value 0 or 1, and then each node passes a value independently to each of its children according to a 2x2 transition matrix P. We say that "reconstruction is possible" if the values at the d'th level of the tree contain non-vanishing information about the value at the root as $d\to\infty$. Adapting a method of Brightwell and Winkler, we obtain new conditions under which reconstruction is impossible, both in the general case and in the special case $p_{11}=0$. The latter case is closely related to the "hard-core model" from statistical physics; a corollary of our results is that, for the hard-core model on the (k+1)-regular tree with activity $\lambda=1$, the unique simple invariant Gibbs measure is extremal in the set of Gibbs measures, for any k.

Affiliated with

Also associated with

No associations

Rating

Reconstruction thresholds on regular trees 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 thresholds on regular trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstruction thresholds on regular trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-648999