Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence (Q6113511): Difference between revisions

The authors consider the following framework: a biased coin with two sides is tossed independently and repeatedly, where 0 is used to denote ``tail'' and 1 to denote ``head''. In unbiased case, the length of longest head-run's limit behavior was studied in many sources. But the situation is much more complicated when the coin-tossing is biased. The purpose of the present paper is to establish lower and upper bounds for the length of longest consecutive switches in independent, identically distributed and biased Bernoulli sequences. A ``switch'' is a tail followed by a head or a head followed by a tail. A limit result on the length of the longest consecutive switches is given with probability 1 and is established after some preliminary theorems about random sequences.