Brasil | Artículos de revistas
dc.creatorGallo, S
dc.date2011
dc.dateSEP
dc.date2014-07-30T16:51:37Z
dc.date2015-11-26T17:51:01Z
dc.date2014-07-30T16:51:37Z
dc.date2015-11-26T17:51:01Z
dc.date.accessioned2018-03-29T00:34:23Z
dc.date.available2018-03-29T00:34:23Z
dc.identifierAdvances In Applied Probability. Applied Probability Trust, v. 43, n. 3, n. 735, n. 759, 2011.
dc.identifier0001-8678
dc.identifierWOS:000295554900008
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/62665
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/62665
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1289864
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionWe 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.
dc.description43
dc.description3
dc.description735
dc.description759
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFAPESP [2006/57387-0]
dc.languageen
dc.publisherApplied Probability Trust
dc.publisherSheffield
dc.publisherInglaterra
dc.relationAdvances In Applied Probability
dc.relationAdv. Appl. Probab.
dc.rightsfechado
dc.sourceWeb of Science
dc.subjectVariable length memory chain
dc.subjectprobabilistic context tree
dc.subjectperfect simulation
dc.subjectregeneration scheme
dc.subjectRepresentation
dc.subjectUniqueness
dc.titleCHAINS WITH UNBOUNDED VARIABLE LENGTH MEMORY: PERFECT SIMULATION AND A VISIBLE REGENERATION SCHEME
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución