Asymptotic Equipartition Properties for simple hierarchical and networked structures

Details Asymptotic Equipartition Properties for simple hierarchical and networked structures Asymptotic Equipartition Properties for simple hierarchical and networked structures

2010-06-13

arxiv.org/abs/1006.2523v2

Computer Science

Information Theory

25 pages

Scientific paper

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 $nH$ bits, where $H$ is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Equipartition Properties for simple hierarchical and networked structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Equipartition Properties for simple hierarchical and networked structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Equipartition Properties for simple hierarchical and networked structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625997