Article contents
Asymptotic equipartition properties for simple hierarchical and networked structures
Published online by Cambridge University Press: 03 July 2012
Abstract
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, SMAI, 2012
References
Références
- 6
- Cited by