Title :
Typicality graphs and their properties
Author :
Nazari, Ali ; Krithivasan, Dinesh ; Pradhan, S. Sandeep ; Anastasopoulos, Achilleas ; Venkataramanan, Ramji
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI, USA
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 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. These properties arise in the study of several multiuser communication problems.
Keywords :
graph theory; bipartite graph; finite alphabets; joint distribution; multiuser communication problems; n-length sequences; typicality graphs; Bipartite graph; Broadcasting; Computer science; Context; Feedback; Histograms; Information theory; Random variables;
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
DOI :
10.1109/ISIT.2010.5513495
