The behavior of a Markov network with respect to an absorbing class: the target algorithm
DOI10.1051/RO/2009019zbMATH Open1173.60026OpenAlexW2086998120MaRDI QIDQ3398586FDOQ3398586
Authors: Giacomo Aletti 
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
Recommendations
- Reduction of absorbing Markov chain
- scientific article; zbMATH DE number 3940340
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- scientific article; zbMATH DE number 549928
- Reachability problems for Markov chains
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)
Cites Work
- Probability distribution functions of succession quotas in the case of Markov dependent trials
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Sooner waiting time problems in a sequence of trinary trials
- Explicit distributional results in pattern formation
- Sooner and later waiting time problems for runs in Markov dependent bivariate trials
- Title not available (Why is that?)
- On some waiting time problems
- Stopping Markov processes and first path on graphs
- Cusum techniques for technical trading in financial markets
Cited In (3)
This page was built for publication: The behavior of a Markov network with respect to an absorbing class: the target algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398586)
