Probabilities of Clumps in a Binary Sequence (and How to Evaluate Them Without Knowing a Lot)

DOI10.2307/2691283zbMATH Open0880.05006OpenAlexW4243346773MaRDI QIDQ4340248

David M. Bloom

Publication date: 28 January 1998

Full work available at URL: https://doi.org/10.2307/2691283

zbMATH Keywords

recurrencebinary sequencerunrandom stringindistinguishable objects

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Recommendations

• Title not available (Why is that?) 👍 👎
• On the lifetime of a random binary sequence 👍 👎
• Binary sequential representations of random partitions 👍 👎
• Probability approximations via the Poisson clumping heuristic 👍 👎
• On a problem of the statistical analysis of binary random sequences 👍 👎
• On Random Binary Sequences 👍 👎
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings 👍 👎
• Probability bounds on the finite sum of the binary sequence of order k 👍 👎
• Random double sequences with a given number of steps 👍 👎

This page was built for publication: Probabilities of Clumps in a Binary Sequence (and How to Evaluate Them Without Knowing a Lot)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340248)