Recursive equations in finite Markov chain imbedding
From MaRDI portal
Publication:2393153
DOI10.1007/s10463-012-0381-xzbMath1396.60086OpenAlexW2004659988MaRDI QIDQ2393153
Publication date: 7 August 2013
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10463-012-0381-x
finite Markov chain imbeddingprobability generating functionwaiting timesimple and compound patternsrecursive equation
Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distribution and double generating function of number of patterns in a sequence of Markov dependent multistate trials
- Exact and asymptotic results for pattern waiting times
- On average run lengths of control charts for autocorrelated processes
- On waiting time distributions associated with compound patterns in a sequence of multi-state trials
- A generalized Pólya urn model and related multivariate distributions
- Waiting time problems for a sequence of discrete random variables
- On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
- A unified Markov chain approach for computing the run length distribution in control charts with simple or compound rules.
- Distribution of waiting time until the \(r\)th occurrence of a compound pattern
- Distribution Theory of Runs: A Markov Chain Approach
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- Sooner and later waiting time problems for patterns in Markov dependent trials
- On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
This page was built for publication: Recursive equations in finite Markov chain imbedding
