Waiting time distributions of runs in higher order Markov chains
From MaRDI portal
Publication:1768130
DOI10.1007/BF02530548zbMath1077.60052MaRDI QIDQ1768130
Publication date: 14 March 2005
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (5)
Weak runs in sequences of binary trials ⋮ Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes ⋮ Minimum and maximum distances between failures in binary sequences ⋮ Distributions of patterns of two successes separated by a string of \(k-2\) failures ⋮ Counting certain binary strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sooner and later waiting time problems for Markovian Bernoulli trials
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Discrete distributions of order k on a binary sequence
- On binomial distributions of order k
- Waiting time problems for a sequence of discrete random variables
- On number of occurrences of success runs of specified length in a higher-order two-state Markov chain
- Scan statistics and applications
- Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
- On a waiting time distribution in a sequence of Bernoulli trials
- Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
- Sooner and later waiting time problems in a two-state Markov chain
- Runs, scans and urn model distributions: A unified Markov chain approach
- Distribution Theory of Runs: A Markov Chain Approach
- Joint distributions of successes, failures and patterns in enumeration problems
- Mixing sequences of random variables and probablistic number theory
- Successes, runs and longest runs
- Scan statistics
- Distributions of the numbers of failures and successes in a waiting time problem
This page was built for publication: Waiting time distributions of runs in higher order Markov chains