On the concentration of runs of ones of length exceeding a threshold in a Markov chain

Makri, Frosso S.; Psillakis, Zaharias M.; Arapis, Anastasios N.

doi:10.1080/02664763.2018.1455815

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During the past few decades up to recently, the meaningful progress on runs and pattern statistics has been wonderfully surveyed in Balakrishnan and Koutras (2003) as well as in Fu and Lou (2003) and references therein. Furthermore, there are some more recent contributions on the topic such as Arapis et al (2018), Eryilmaz (2018), Kong (2019), Makri et al (2019), and Aki (2019).…”

Section: [1110][11110][11110][0][110]mentioning

confidence: 99%

Run and Frequency quotas for q-binary trials

Oh¹

2022

Preprint

View full text Add to dashboard Cite

We study the distributions of waiting times in variations of the q-sooner and later waiting time problem. One variation imposes length and frequency quotas on the runs of successes and failures. Another case considers binary trials for which the probability of ones is geometrically varying. We also study the distributions of Longest run under the same variations. The main theorems are sooner and later waiting time problem and the joint distribution of the length of the longest success and longest failure runs when a run and frequency quotas imposed on runs of successes and failure. In the present work, we consider a sequence of independent binary (0 − 1) trials with not necessarily identical distributed with probability of ones varying according to a geometric rule. Exact formulae for the distributions obtained by means of enumerative combinatorics.

show abstract