Information flow on trees
The authors try to answer the following question: Let \(T\) be a tree network, where each edge acts as an independent copy of a given channel \(M\). Suppose that information is propagated from the root. For which \(T\) and \(M\) the configuration obtained at level \(n\) of \(T\) typically contains significant information on the root variable?
scientific article