Information flow on trees (Q1425477)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2061203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Information flow on trees |
scientific article; zbMATH DE number 2061203 |
Statements
Information flow on trees (English)
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
tree network
0 references
information flow
0 references
0.7477273344993591
0 references
0.7459937930107117
0 references
0.7293933033943176
0 references
