# Asymptotic Equipartition Properties for simple hierarchical and networked structures - Computer Science > Information Theory

Asymptotic Equipartition Properties for simple hierarchical and networked structures - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We prove asymptotic equipartition properties for simple hierarchicalstructures modelled as multitype Galton-Watson trees and networked structuresmodelled as randomly coloured random graphs. For example, for large $n$, anetworked data structure consisting of $n$ units connected by an average numberof links of order $n-log n$ can be coded by about $nH$ bits, where $H$ is anexplicitly defined entropy. The main technique in our proofs are largedeviation principles for suitably defined empirical measures.

Author: ** Kwabena Doku-Amponsah**

Source: https://arxiv.org/