Shy couplings

Simple item page
dc.creatorBenjamini, Itai
dc.creatorBurdzy, Krzysztof
dc.creatorChen, Zhen-Qing
dc.date2005-09-20
dc.date.accessioned2026-07-07T06:18:31Z
dc.date.available2026-07-07T06:18:31Z
dc.descriptionA pair of Markov processes is called a Markov coupling if both processes have the same transition probabilities and the pair is also a Markov process. We say that a coupling is ``shy'' if the processes never come closer than some (random) strictly positive distance from each other. We investigate whether shy couplings exist for several classes of Markov processes.
dc.identifierhttps://arxiv.org/abs/math/0509458
dc.identifierhttp://arxiv.org/abs/math/0509458
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94759
dc.subjectProbability
dc.subject60J99
dc.titleShy couplings
dc.typetext

Files

Collections

arXiv