Typicality Graphs:Large Deviation Analysis

Abstract

Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any ε > 0, the set of n-length sequences xn and yn that are jointly typical ckbook according to PXY can be represented on a bipartite graph. We present a formal definition of such a graph, known as a typicality graph, and study some of its properties.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…