E. MOSSEL, "Survey: Information flow on trees," Preprint, October 2002, to appear in DIMACS volume Graphs, Morphisms and Statistical Physics. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Robust Reconstruction on Trees is Determined By the Second.. - Janson, Mossel (2002) Self-citation (Mossel) (Correct)
....copies of M. Equivalently, for a vertex v, let v # be the parent of v, and let #(v) be the set of all vertices which are connected to # through paths which do not contain v. Then the process satisfies: P[# v = j (# w ) w##(v) P[# v = j # v # ] M # v # ,j . We refer the reader to [2, 9, 10] for background and motivation for studying this model. Let d( denote the graph metric distance on T , and L n = v # V : d(#, v) n be the n th level of the tree. For v V and e = v, w) E, we denote v = d(#, v) and e = max v , w . We denote by # n = #(v) v#Ln the ....
Mossel, E. (2002). Survey: Information flow on trees, to appear.
Boundary Conditions and Mixing Time - Fabio Martinelli Alistair (Correct)
No context found.
E. MOSSEL, "Survey: Information flow on trees," Preprint, October 2002, to appear in DIMACS volume Graphs, Morphisms and Statistical Physics.
Fast Mixing for Independent Sets, - Colorings And Other (Correct)
No context found.
E. MOSSEL, "Survey: Information flow on trees," Preprint, October 2002, to appear in DIMACS volume Graphs, Morphisms and Statistical Physics.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC