Variance of Longest Run Duration in a Random Bitstring
From MaRDI portal
Permutations, words, matrices (05A05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Probability theory (educational aspects) (97K50) Mathematical programming (educational aspects) (97N60)
Abstract: We continue an earlier study, starting with unconstrained -bitstrings, focusing now less on average behavior and more on uncertainty. The interplay between longest runs of 0s and of 1s, when bitstrings are multus longest runs of 0s and bitsums (# of 1s), when bitstrings are solus is examined. While negative correlations approach zero as in the former (for clumped 1s), the limit is evidently nonzero in the latter (for separated 1s). Similar analysis is possible when both 0s and 1s are clumped (bimultus), and when 0s are clumped but 1s are separated (persolus). Our methods are experimentally-based.
This page was built for publication: Variance of Longest Run Duration in a Random Bitstring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6341373)
