Realizable monotonicity for continuous-time Markov processes

Paolo Dai Pra, Pierre-Yves Louis and Ida Germana Minelli

Stochastic Processes and their Applications, 2010, vol. 120, issue 6, 959-982

Abstract: We formalize and analyze the notions of stochastic monotonicity and realizable 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 stochastic monotonicity and realizable monotonicity coincide in continuous-time but not in discrete-time.

Keywords: Markov; processes; Coupling; Partial; ordering; Stochastic; monotonicity; Realizable; monotonicity; Monotone; random; dynamical; system; representation (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(10)00049-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:120:y:2010:i:6:p:959-982

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().