Information flow on trees (Q1425477)

From MaRDI portal
Revision as of 14:31, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q225554)
scientific article
Language Label Description Also known as
English
Information flow on trees
scientific article

    Statements

    Information flow on trees (English)
    0 references
    0 references
    0 references
    21 March 2004
    0 references
    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?
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree network
    0 references
    information flow
    0 references