Abstract
Suppose a supercritical Galton-Watson random branching process with a finite number of types is given. Then, with probability one in the set of infinitely extended derivation trees, functions of derivations that are additive on subtrees normalized by the number of subtrees converge to their expected values. As corollaries of this general result, convergence is shown for sample entropy, codeword length for codes assigned to subtrees, and number of terminals. An extension of this result shows convergence of ratios of such functions yielding convergence of entropy per terminal as a special case.
| Original language | English |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Conference
| Conference | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 06/27/94 → 07/1/94 |