pith. sign in

arxiv: 2606.10074 · v1 · pith:3U4G4E4Snew · submitted 2026-06-08 · 🧮 math.PR

On difference in word frequencies in a symmetric Bernoulli process

classification 🧮 math.PR
keywords bernoulliprocessfrequencylongwordadvantagedifferencelength
0
0 comments X
read the original abstract

In a symmetric Bernoulli process, all binary strings, or ``words'' of the same length have the same long term frequency. However, between two such words, one may have a ``frequency advantage'' in the sense that in any long enough segment of the Bernoulli process, the probability that the word occurs more times than the other word is greater than the probability the other way around. To characterize the frequency advantage in the long run, the asymptotics of the difference between the two probabilities as the length of the segment of the Bernoulli process tends to infinity is derived.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.