Título: Geometric Ergodicity and Perfect Simulation
Autores: Kendall, Wilfrid S.; University of Warwick
Fecha: 2004-01-01
Publicador: Electronic communications in probability
Fuente:
Tipo: Peer-reviewed Article

Tema: No aplica
Descripción: This note extends the work of Foss and Tweedie (1998), who showed that availability of the classic Coupling from the Past (CFTP) algorithm of Propp and Wilson (1996) is essentially equivalent to uniform ergodicity for a Markov chain (see also Hobert and Robert, 2004). In this note we show that all geometrically ergodic chains possess dominated CFTP algorithms (not necessarily practical!) which are rather closely connected to Foster-Lyapunov criteria. Hence geometric ergodicity implies dominated CFTP.
Idioma: No aplica

Artículos similares:

Simulations and Conjectures for Disconnection Exponents por Puckette, Emily E.; Occidental College,Werner, Wendelin; Université Paris-Sud and IUF
A Proof of a Conjecture of Bobkov and Houdré por Kwapien, S.; Warsaw University,Pycia, M.; Warsaw University,Schachermayer, W.; University of Vienna
Excursions Into a New Duality Relation for Diffusion Processes por Jansons, Kalvis M.; University College London
Moderate Deviations for Martingales with Bounded Jumps por Dembo, Amir; Stanford University
Percolation Beyond $Z^d$, Many Questions And a Few Answers por Benjamini, Itai; Weizmann Institute of Science,Schramm, Oded; Microsoft Research
Bounds for Disconnection Exponents por Werner, Wendelin; Université Paris-Sud and IUF
Transportation Approach to Some Concentration Inequalities in Product Spaces por Dembo, Amir; Stanford University,Zeitouni, Ofer; Technion - Israel Institute of Technology
The Dimension of the Frontier of Planar Brownian Motion por Lawler, Gregory F.; Duke University
10 
Surface Stretching for Ornstein Uhlenbeck Velocity Fields por Carmona, Rene; Princeton University,Grishin, Stanislav; Princeton University,Xu, Lin; Princeton University,Molchanov, Stanislav; University of North Carolina at Charlotte