Recurrence algorithms of waiting time for the success run of length $k$ in relation to generalized Fibonacci sequences

Abstract

Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in sequences of independent and Markov dependent Bernoulli trials using generalized Fibonacci sequences of order $k$. Maximum likelihood estimation (MLE) methods for the probability distributions are presented in both cases with simulation examples.