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 [1] 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.
Ali Nazari, Ramji Venkataramanan, Dinesh Krithivas