Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Perfect Simulation Of A Coupling Achieving The D̄-distance Between Ordered Pairs Of Binary Chains Of Infinite Order|
|Abstract:||We explicitly construct a stationary coupling attaining Ornstein's d̄-distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely. © 2010 Springer Science+Business Media, LLC.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.