Brasil
| Artículos de revistas
CHAINS WITH UNBOUNDED VARIABLE LENGTH MEMORY: PERFECT SIMULATION AND A VISIBLE REGENERATION SCHEME
dc.creator | Gallo, S | |
dc.date | 2011 | |
dc.date | SEP | |
dc.date | 2014-07-30T16:51:37Z | |
dc.date | 2015-11-26T17:51:01Z | |
dc.date | 2014-07-30T16:51:37Z | |
dc.date | 2015-11-26T17:51:01Z | |
dc.date.accessioned | 2018-03-29T00:34:23Z | |
dc.date.available | 2018-03-29T00:34:23Z | |
dc.identifier | Advances In Applied Probability. Applied Probability Trust, v. 43, n. 3, n. 735, n. 759, 2011. | |
dc.identifier | 0001-8678 | |
dc.identifier | WOS:000295554900008 | |
dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/62665 | |
dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/62665 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1289864 | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | 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. | |
dc.description | 43 | |
dc.description | 3 | |
dc.description | 735 | |
dc.description | 759 | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | FAPESP [2006/57387-0] | |
dc.language | en | |
dc.publisher | Applied Probability Trust | |
dc.publisher | Sheffield | |
dc.publisher | Inglaterra | |
dc.relation | Advances In Applied Probability | |
dc.relation | Adv. Appl. Probab. | |
dc.rights | fechado | |
dc.source | Web of Science | |
dc.subject | Variable length memory chain | |
dc.subject | probabilistic context tree | |
dc.subject | perfect simulation | |
dc.subject | regeneration scheme | |
dc.subject | Representation | |
dc.subject | Uniqueness | |
dc.title | CHAINS WITH UNBOUNDED VARIABLE LENGTH MEMORY: PERFECT SIMULATION AND A VISIBLE REGENERATION SCHEME | |
dc.type | Artículos de revistas |