2 papers
cs.DS2026
Efficient Uniform Sampling of Surjections via their Profiles
Arnaud Carayol, Pablo Rotondo
In this article, we develop efficient sampling algorithms for random surjections from to for all . We make no assumption about and . In particular, we…
math.DS2025
Shannon Weights for binary dynamical recurrent sources of zero entropy
Ali Akhavi, Eda Cesaratto, Frédéric Paccaut +2
A probabilistic source is defined as the set of infinite words (over a given denumerable alphabet) endowed with a probability . The paper deals with general binary sources wher…