On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
DOI10.1016/j.spl.2016.03.011zbMath1376.60068OpenAlexW2343933181MaRDI QIDQ297140
Zaharias M. Psillakis, Frosso S. Makri, Anastasios N. Arapis
Publication date: 24 June 2016
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2016.03.011
Exact distribution theory in statistics (62E15) Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compound Markov negative binomial distribution
- Distribution of run statistics in partially exchangeable processes
- On runs of length exceeding a threshold: normal approximation
- Discrete time shock models involving runs
- Non-parametric randomness tests based on success runs of fixed length
- The exact distribution of the \(k\)-tuple statistic for sequence homology
- Circular success and failure runs in a sequence of exchangeable binary trials
- Central limit theorem approximations for the number of runs in Markov-dependent binary sequences
- Geometric distribution of order \(k\) with a reward
- Length of the minimum sequence containing repeats of success runs
- Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes
- \(g\)-geometric and \(g\)-binomial distributions of order image
- Success runs in a sequence of exchangeable binary trials
- Distribution Theory of Runs: A Markov Chain Approach
- Run Probabilities in Sequences of Markov-Dependent Trials
- Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model
This page was built for publication: On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence