Survey: Information flow on trees

Simple item page
dc.creatorMossel, Elchanan
dc.date2004-06-23
dc.date.accessioned2026-07-07T08:06:19Z
dc.date.available2026-07-07T08:06:19Z
dc.descriptionConsider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant information on the root variable? This model appeared independently in biology, information theory, and statistical physics. Its analysis uses techniques from the theory of finite markov chains, statistics, statistical physics, information theory, cryptography and noisy computation. In this paper, we survey developments and challenges related to this problem.
dc.identifierhttps://arxiv.org/abs/math/0406446
dc.identifierhttp://arxiv.org/abs/math/0406446
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130565
dc.subjectProbability
dc.subjectStatistics Theory
dc.subject60J80; 60K35, 60F05
dc.titleSurvey: Information flow on trees
dc.typetext

Files

Collections

arXiv