English

Typicality Graphs:Large Deviation Analysis

Information Theory 2010-10-11 v2 math.IT

Abstract

Let X\mathcal{X} and Y\mathcal{Y} be finite alphabets and PXYP_{XY} a joint distribution over them, with PXP_X and PYP_Y representing the marginals. For any ϵ>0\epsilon > 0, the set of nn-length sequences xnx^n and yny^n that are jointly typical \cite{ckbook} according to PXYP_{XY} 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}
}
R2 v1 2026-06-21T16:24:58.427Z