Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence
Abstract
In this paper we mainly discuss sharp lower and upper bounds for the length of longest consecutive switches in IID Bernoulli sequences. This work is an extension of results in Erdos and R\'ev\'esz (1975) for longest head-run and Hao et al. (2021) for longest consecutive switches in unbiased coin-tossing, and might be applied to reliability theory, biology, quality control, pattern recognition, finance, etc.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.