Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Perfect simulation for locally continuous chains of infinite order
Author: Gallo, S
Garcia, NL
Abstract: We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the traditional continuous case, probabilistic context trees and discontinuous kernels. Since our assumptions are more refined than uniform continuity, our algorithms perfectly simulate continuous chains faster than the existing algorithms of the literature. We provide several illustrative examples. (c) 2013 Elsevier B.V. All rights reserved.
Subject: Perfect simulation
Chains of infinite order
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/
Date Issue: 2013
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.