Asymptotic equipartition properties for simple hierarchical and networked structures
We prove for simple hierarchical structures (modelled as ) and networked structures (modelled as ). For example, for large , a networked data structure consisting of units connected by an average number of links of order log can be coded by about × bits, where is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.