pith. sign in

arxiv: 1010.1317 · v2 · pith:3MW576CDnew · submitted 2010-10-07 · 💻 cs.IT · math.IT

Typicality Graphs:Large Deviation Analysis

classification 💻 cs.IT math.IT
keywords graphmathcaltypicalityaccordingalphabetsanalysisbipartitecite
0
0 comments X
read the original abstract

Let $\mathcal{X}$ and $\mathcal{Y}$ be finite alphabets and $P_{XY}$ a joint distribution over them, with $P_X$ and $P_Y$ representing the marginals. For any $\epsilon > 0$, the set of $n$-length sequences $x^n$ and $y^n$ that are jointly typical \cite{ckbook} according to $P_{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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.