Lossy Asymptotic Equipartition property for Networked Data Structures

Abstract

In this article we prove a Generalized Asypmtotic Equipartition Property for Networked Data Structures modelled as coloured random graphs. The main techniques in this article remains large deviation principles for suitably defined empirical measures on coloured random graphs. We apply our main result to a concrete example from the field of Biology.

9 pages

References in corpus (1)

• Large deviations of empirical neighborhood distribution in sparse random graphs

Cited by in corpus (2)

• Local Large deviation: A McMillian Theorem for Coloured Random Graph Processes
• Lossy Asymptotic Equipartition Property For Geometric Networked Data Structures