The behavior of a Markov network with respect to an absorbing class: the target algorithm
From MaRDI portal
Publication:3398586
DOI10.1051/ro/2009019zbMath1173.60026OpenAlexW2086998120MaRDI QIDQ3398586
Publication date: 29 September 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105431
Computational methods in Markov chains (60J22) Programming involving graphs or networks (90C35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of graph theory to circuits and networks (94C15)
Related Items
Cites Work
- Unnamed Item
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Cusum techniques for technical trading in financial markets
- Probability distribution functions of succession quotas in the case of Markov dependent trials
- Sooner and later waiting time problems for runs in Markov dependent bivariate trials
- Explicit distributional results in pattern formation
- Stopping Markov processes and first path on graphs
- Sooner waiting time problems in a sequence of trinary trials
- On some waiting time problems