Infinite Divisibility of Information
From MaRDI portal
Abstract: We study an information analogue of infinitely divisible probability distributions, where the i.i.d. sum is replaced by the joint distribution of an i.i.d. sequence. A random variable is called informationally infinitely divisible if, for any , there exists an i.i.d. sequence of random variables that contains the same information as , i.e., there exists an injective function such that . While there does not exist informationally infinitely divisible discrete random variable, we show that any discrete random variable has a bounded multiplicative gap to infinite divisibility, that is, if we remove the injectivity requirement on , then there exists i.i.d. and satisfying , and the entropy satisfies . We also study a new class of discrete probability distributions, called spectral infinitely divisible distributions, where we can remove the multiplicative gap . Furthermore, we study the case where is itself an i.i.d. sequence, , for which the multiplicative gap can be replaced by . This means that as increases, becomes closer to being spectral infinitely divisible in a uniform manner. This can be regarded as an information analogue of Kolmogorov's uniform theorem. Applications of our result include independent component analysis, distributed storage with a secrecy constraint, and distributed random number generation.
Recommendations
- Infinite Shannon entropy
- Infinite-dimensional divergence information analysis
- scientific article; zbMATH DE number 5046294
- Statistical estimation of the structure of a finite population
- Information-theoretic incompleteness
- Information-Theoretic Incompleteness
- The limits of information
- Finite self-information
This page was built for publication: Infinite Divisibility of Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088550)