2010
DOI: 10.1016/j.spa.2010.03.002
|View full text |Cite
|
Sign up to set email alerts
|

Realizable monotonicity for continuous-time Markov processes

Abstract: We formalize and analyze the notions of stochastic monotonicity and realizable monotonicity for Markov Chains ill 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. (C) 2010 Elsevier B.V. All rights reserved

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Property (11) is usually called attractiveness. Condition (8) implies the stronger complete monotonicity property ( [13,9]), that is, existence of a monotone Markov coupling for an arbitrary number of processes with generator (2), see (27) below; we also say that the process is strongly attractive.…”
Section: Notation and Resultsmentioning
confidence: 99%
“…Property (11) is usually called attractiveness. Condition (8) implies the stronger complete monotonicity property ( [13,9]), that is, existence of a monotone Markov coupling for an arbitrary number of processes with generator (2), see (27) below; we also say that the process is strongly attractive.…”
Section: Notation and Resultsmentioning
confidence: 99%
“…Property ( 17) implies (2), that is, attractiveness. But it is more powerful: it implies the complete monotonicity property ( [24,20]), that is, existence of a monotone Markov coupling for an arbitrary number of processes with generator (4), which is necessary in our proof of strong hydrodynamics for general initial profiles. The coupled process can be defined by a Markov generator, as in [19] for two components, that is…”
Section: Graphical Constructionmentioning
confidence: 99%