Recursive overlap Bernoulli distributions and an entropy concavity conjecture

Jörg Neunhäuserer

Home/Archive/arXiv

arXiv · 2609.05546

Recursive overlap Bernoulli distributions and an entropy concavity conjecture

Jörg Neunhäuserer

View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a family of recursively generated finite probability distributions obtained from left and right embeddings with overlaps. The construction interpolates between the classical binomial distribution and the non-overlapping Bernoulli product distribution. We derive explicit formulas for the expectation, variance, and the generating function of higher moments, and formulate a conjecture asserting that the Shannon entropy is concave. The conjecture is proved in the two extremal cases and supported by symbolic computations for numerous overlap sequences.

Explore related subjects

cs.IT math.DS math.IT

Keep this discovery

BibTeX RIS

Jörg Neunhäuserer. 2026-09-02. Recursive overlap Bernoulli distributions and an entropy concavity conjecture. https://arxiv.org/abs/2609.05546

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.IT subject math.DS subject math.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Oracle-free Boltzmann Sampling for Powersets

We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating function. Our approach relies on a Poissonised infinite occupancy model and thinning. It yields an explicit sampler for bounded counting sequences and extends under mild growth conditions. We implement the sampler and find runtimes comparable to existing Boltzmann samplers.

cs.DM↗

arXiv2025

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG↗

arXiv2026

Equation free data-driven modelling of chaotic processes

We introduce a method for constructing predictive models of non cyclic physical processes directly from time-series data, without assuming an underlying differential equation. The observations define a discrete evolution rule whose recurrent behaviour captures the essential dynamics of the process. Analysing this behaviour across multiple geometric scales leads to probabilistic models in the form of Markov chains. Hyperbolicity criteria identify when these models provide a consistent statistical description of the data. The method is inspired by, and illustrated through, the analysis of a biological imaging data set referred to as the Cell Process.

math.DS↗