| Texto completo | |
| Autor(es): |
Gallo, Sandro
[1]
Número total de Autores: 1
|
| Afiliação do(s) autor(es): | [1] Univ Estadual Campinas, BR-13083859 Campinas, SP - Brazil
Número total de Afiliações: 1
|
| Tipo de documento: | Artigo Científico |
| Fonte: | ADVANCES IN APPLIED PROBABILITY; v. 43, n. 3, p. 735-759, SEP 2011. |
| Citações Web of Science: | 12 |
| Resumo | |
We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infinite memory chains for which the family of transition probabilities is represented by a probabilistic context tree. We do not assume any continuity condition: our condition is expressed in terms of the structure of the context tree. More precisely, the length of the contexts is a deterministic function of the distance to the last occurrence of some determined string of symbols. It turns out that the resulting class of chains can be seen as a natural extension of the class of chains having a renewal string. In particular, our chains exhibit a visible regeneration scheme. (AU) | |
| Processo FAPESP: | 06/57387-0 - Estimacao de cadeias de alcance variavel e identificacao de padroes ritmicos nas linguas naturais. |
| Beneficiário: | Alexsandro Giacomo Grimbert Gallo |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |