Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T03:08:38.539Z Has data issue: false hasContentIssue false

Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory

Published online by Cambridge University Press:  04 February 2016

Emilio De Santis*
Affiliation:
Sapienza Università di Roma
Mauro Piccioni*
Affiliation:
Sapienza Università di Roma
*
∗ Postal address: Dipartimento di Matematica, Sapienza Università di Roma, Piazzale Aldo Moro 2, 00185 Roma, Italy.
∗ Postal address: Dipartimento di Matematica, Sapienza Università di Roma, Piazzale Aldo Moro 2, 00185 Roma, Italy.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper is devoted to the perfect simulation of a stationary process with an at most countable state space. The process is specified through a kernel, prescribing the probability of the next state conditional to the whole past history. We follow the seminal work of Comets, Fernández and Ferrari (2002), who gave sufficient conditions for the construction of a perfect simulation algorithm. We define backward coalescence times for these kind of processes, which allow us to construct perfect simulation algorithms under weaker conditions than in Comets, Fernández and Ferrari (2002). We discuss how to construct backward coalescence times (i) by means of information depths, taking into account some a priori knowledge about the histories that occur; and (ii) by identifying suitable coalescing events.

Information

Type
Research Article
Copyright
© Applied Probability Trust