Higher-order Common Information
Abstract
We present a new notion of higher-order common information, which quantifies the information that arbitrarily distributed random variables have in common. We provide analytical lower bounds on and for jointly Gaussian distributed sources and provide computable lower bounds for for any and any sources. We also provide a practical method to estimate the lower bounds on, e.g., real-world time-series data. As an example, we consider EEG data acquired in a setup with competing acoustic stimuli. We demonstrate that has descriptive properties that is not in . Moreover, we observe a linear relationship between the amount of common information communicated from the acoustic stimuli and to the brain and the corresponding cortical activity in terms of neural tracking of the envelopes of the stimuli.
Cite
@article{arxiv.2406.02001,
title = {Higher-order Common Information},
author = {Jan Østergaard},
journal= {arXiv preprint arXiv:2406.02001},
year = {2024}
}
Comments
Submitted to IEEE Transactions on Information Theory