Return to search

Complete monotone coupling for Markov processes

We formalize and analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However, we show that there are partially ordered sets for which monotonicity and complete monotonicity coincide in continuoustime but not in discrete-time.

Identiferoai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:1828
Date January 2008
CreatorsPra, Paolo Dai, Louis, Pierre-Yves, Minelli, Ida G.
PublisherUniversität Potsdam, Mathematisch-Naturwissenschaftliche Fakultät. Institut für Mathematik, Extern. Extern
Source SetsPotsdam University
LanguageGerman
Detected LanguageEnglish
TypePreprint
Formatapplication/pdf
Rightshttp://opus.kobv.de/ubp/doku/urheberrecht.php

Page generated in 0.002 seconds