Common Information Dimension
Quantifying the common information between random variables is a fundamental problem with a long history in information theory. Traditionally, common information is measured in number of bits and thus such measures are mostly informative when the common information is finite. However, the common information between continuous variables can be infinite; in such cases, a real-valued random vector <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">W</i> may be needed to represent the common information, and to be used for instance for distributed simulation. In this paper, we propose the concept of Common Information Dimension (CID) and three variants. We compute the common information dimension for jointly Gaussian random vectors in a closed form. Moreover, we analytically prove, under two different formulations, that the growth rate of common information in the nearly infinite regime is determined by the common information dimension, for the case of two Gaussian vectors.
Authors
- Osama A. Hanna (ORCID: https://orcid.org/0000-0002-7721-4854)
- Christina Fragouli (ORCID: https://orcid.org/0000-0003-1002-5829)
- Suhas Diggavi (ORCID: https://orcid.org/0000-0001-7313-9861)
- Xinlin Li (ORCID: https://orcid.org/0000-0003-3882-5166)
Institutions
- University of California, Los Angeles (US)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2025-04-15
- DOI
- https://doi.org/10.1109/tit.2025.3560674
- Primary Topic
- Wireless Communication Security Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Division of Computing and Communication Foundations
- Division of Computer and Network Systems
- Army Research Laboratory