Metraipolis › archive › dc_2f756d43ae5b
Entropic Inequalities and Limit Theorems in Boolean Probability — arXiv:2610.20178
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20178
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:36:20.459Z
- SHA-256 of the archived text
c88a7c08315af591859f6abb1b2ad741174c548e3a40829d1559d2ec67e772f9- Stable URL of this page
https://metraipolis.com/documento/dc_2f756d43ae5b
How to cite
Entropic Inequalities and Limit Theorems in Boolean Probability — arXiv:2610.20178 — arXiv (en), https://arxiv.org/abs/2610.20178 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f756d43ae5b (Metraipolis archive dc_2f756d43ae5b, sha256 c88a7c08315af591859f6abb1b2ad741174c548e3a40829d1559d2ec67e772f9)
BibTeX
@misc{dc2f756d43ae5b,
title = {Entropic Inequalities and Limit Theorems in Boolean Probability — arXiv:2610.20178},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20178},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f756d43ae5b; sha256 c88a7c08315af591859f6abb1b2ad741174c548e3a40829d1559d2ec67e772f9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20178. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study Boolean entropy and Fisher information in information inequalities and the Boolean central limit theorem. We prove a fractional Stam inequality for the Boolean Fisher information associated with arbitrary fractional partitions of subset sums, and derive an entropy power inequality for sums of Boolean independent random variables and its weighted version. We then establish a Boolean analogue of Barron's entropy convergence result along the Boolean central limit theorem: Boolean entropy converges to the entropy of the Rademacher law if and only if the initial entropy is finite. Furthermore, under a finite fourth moment, in the Boolean central limit theorem, we obtain \[ \Gamma(\mu_n\mid\mathbf b)= \frac{m_4(\mu)-1-m_3(\mu)^2}{2}\frac{\log n}{n} +o\!\left(\frac{\log n}{n}\right), \] with an explicit example showing sharpness. For symmetric laws with finite fourth moment and finite Boolean Fisher information, \[ \Psi(\mu_n\mid\mathbf b) =2\bigl(m_4(\mu)-1\bigr)\frac{\log n}{n} +o\left(\frac{\log n}{n}\right). \] Our approach is based on the Nevanlinna representation of Cauchy transforms.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.20178 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:57:05.408Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).