简单递阶网络结构的渐近均分性质
Asymptotic Equipartition Properties for simple hierarchical and networked structures
摘要:
我们证明了简单的层次结构(建模为多型高尔顿-沃森树)和网络结构(建模为随机着色的随机图)的渐近均分性质。例如,对于大的$n$,由通过平均数量的$n/log n$阶链路连接的$n$单元组成的联网数据结构可以通过大约$nH$比特来编码,其中$H$是明确定义的熵。在我们的证明的主要技术是适当定义的经验措施的大偏差原则。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。