Stopping Markov processes and first path on graphs

DOI10.4171/JEMS/38zbMath1103.60064OpenAlexW1995105271MaRDI QIDQ2496876

Ely Merzbach, Giacomo Aletti

Publication date: 25 July 2006

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/jems/38

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20)

Related Items

Blackwell spaces and \(\epsilon\)-approximations of Markov chains ⋮ How to Reduce Unnecessary Noise in Targeted Networks ⋮ The behavior of a Markov network with respect to an absorbing class: the target algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Sooner waiting time problems in a sequence of trinary trials
• On some waiting time problems
• On Markov-dependent parking problems