Departamento de Matemática

URI Permanente desta comunidade

Agora exibindo 1 - 1 de 1

Stopping probabilities for patterns in markov chains
(2014-03-05) GAVA, R. J.; SALOTTI, D.
Consider a sequence of Markov-dependent trials where each trial produces a letter of a finite alphabet. Given a collection of patterns, we look at this sequence until one of these patterns appears as a run. We show how the method of gambling teams can be employed to compute the probability that a given pattern is the first pattern to occur. © Applied Probability Trust 2014.