Typicality Graphs:Large Deviation Analysis
Information Theory
2010-10-11 v2 math.IT
Abstract
Let and be finite alphabets and a joint distribution over them, with and representing the marginals. For any , the set of -length sequences and that are jointly typical \cite{ckbook} according to can be represented on a bipartite graph. We present a formal definition of such a graph, known as a \emph{typicality} graph, and study some of its properties.
Keywords
Cite
@article{arxiv.1010.1317,
title = {Typicality Graphs:Large Deviation Analysis},
author = {Ali Nazari and Ramji Venkataramanan and Dinesh Krithivasan and S. Sandeep Pradhan and Achilleas Anastasopoulos},
journal= {arXiv preprint arXiv:1010.1317},
year = {2010}
}