Autor(es)

Gava, Renato Jacob ^[1] ; Salotti, Danilo ^[2]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Matemat & Estat, BR-05508090 Sao Paulo - Brazil

^[2] Fundacao Educ Inaciana Padre Saboia Medeiros, Sao Paulo - Brazil

• Tipo de documento: Artigo Científico
• Fonte: JOURNAL OF APPLIED PROBABILITY; v. 51, n. 1, p. 287-292, MAR 2014.
• Citações Web of Science: 1

Resumo

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. (AU)

• Processo FAPESP: 12/01432-9 - Envelhecimento no modelo de armadilhas do GREM
• Beneficiário: Renato Jacob Gava
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado