REVIEW
Shy couplings
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Shy couplings
classification
math.PR
keywords
markovprocessescouplingcouplingspaircalledclassescloser
read the original abstract
A 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.