Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
From MaRDI portal
Publication:6089295
DOI10.1007/s00362-022-01351-7OpenAlexW4291247341MaRDI QIDQ6089295
Serkan N. Eryılmaz, Stathis Chadjiconstantinidis
Publication date: 17 November 2023
Published in: Statistical Papers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00362-022-01351-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-binomial approximation to \((k_1, k_2)\)-runs
- On a modified binomial distribution of order k
- On binomial and circular binomial distributions of order \(k\) for \(l\)-overlapping success runs of length \(k\)
- Distributions related to \((k_{1},k_{2})\) events
- A generalized geometric distribution and some of its properties
- On the use of phase type distributions in reliability modelling of systems with two components
- Start-up demonstration tests under Markov dependence model with corrective actions
- Runs, scans and urn model distributions: A unified Markov chain approach
- Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes
- Waiting time for consecutive repetitions of a pattern and related distributions
- Generalizations of distributions related to \((k_1,k_2)\)-runs
- Shortest and longest length of success runs in binary sequences
- Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns
- Distributions of \((k_1,k_2,\dots ,k_m)\)-runs with multi-state trials
- Matrix-Exponential Distributions in Applied Probability
- System availability in a shock model under preventive repair and phase-type distributions
- Pólya-Eggenberger F-S models of order (k1, k2)
- On Occurrences of F-S Strings in Linearly and Circularly Ordered Binary Sequences
- Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
- On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence
- Distribution Theory of Runs: A Markov Chain Approach
- Computing minimal signature of coherent systems through matrix-geometric distributions
- On discrete distributions of order k
- Successes, runs and longest runs
- Distributions of numbers of success runs of fixed length in Markov dependent trials
This page was built for publication: Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
