scholarly journals A coupling technique for stochastic comparison of functions of Markov Processes

2000 ◽  
Vol 4 (1) ◽  
pp. 39-64 ◽  
Author(s):  
M. Doisy
Keyword(s):  
Markov Process ◽  
Markov Processes ◽  
Sufficient Conditions ◽  
Reliability Theory ◽  
Stochastic Comparison ◽  
Transition Rates ◽  
Coupling Technique ◽  
Fixed Set ◽  
Multiple Component ◽  
Necessary And Sufficient

The aim of this work is to obtain explicit conditions (i.e., conditions on the transition rates) for the stochastic comparison of Markov Processes. A general coupling technique is used to obtain necessary and sufficient conditions for the construction of a coupling Markov Process which stays in a fixed set K for all times and with given marginal processes. The strong stochastic comparison—or, more generally, the stochastic comparison through states functions—appears as a particular case. An example in the Reliability Theory is developed and proves the efficiency of the method. Systems with multiple component types and redundant units are stochastically compared directly or through particular functions.

scholarly journals CLASSICAL MARKOV PROCESSES FROM QUANTUM LÉVY PROCESSES

1999 ◽  
Vol 02 (01) ◽  
pp. 105-129 ◽  
Author(s):  
UWE FRANZ
Keyword(s):  
Markov Process ◽  
Hopf Algebra ◽  
Markov Processes ◽  
Lévy Processes ◽  
Sufficient Conditions ◽  
Markov Property ◽  
Vacuum State ◽  
Levy Processes ◽  
Quantum Process ◽  
Quantum Markov Processes

We show how classical Markov processes can be obtained from quantum Lévy processes. It is shown that quantum Lévy processes are quantum Markov processes, and sufficient conditions for restrictions to subalgebras to remain quantum Markov processes are given. A classical Markov process (which has the same time-ordered moments as the quantum process in the vacuum state) exists whenever we can restrict to a commutative subalgebra without losing the quantum Markov property.8 Several examples, including the Azéma martingale, with explicit calculations are presented. In particular, the action of the generator of the classical Markov processes on polynomials or their moments are calculated using Hopf algebra duality.

Insensitivity and reversed Markov processes

1983 ◽  
Vol 15 (4) ◽  
pp. 752-768 ◽  
Author(s):  
W. Henderson
Keyword(s):  
Markov Processes ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
The Relationship

This paper is concerned with the relationship between insensitivity in a certain class of Markov processes and properties of that process when time is reversed. Necessary and sufficient conditions for insensitivity are established and linked to already proved results. A number of examples of insensitive systems are given.

Insensitivity and reversed Markov processes

1983 ◽  
Vol 15 (04) ◽  
pp. 752-768 ◽  
Author(s):  
W. Henderson
Keyword(s):  
Markov Processes ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
The Relationship

This paper is concerned with the relationship between insensitivity in a certain class of Markov processes and properties of that process when time is reversed. Necessary and sufficient conditions for insensitivity are established and linked to already proved results. A number of examples of insensitive systems are given.

Local conditions for the stochastic comparison of particle systems

2004 ◽  
Vol 36 (4) ◽  
pp. 1252-1277 ◽  
Author(s):  
Rosario Delgado ◽  
F. Javier López ◽  
Gerardo Sanz
Keyword(s):  
Queueing Networks ◽  
Interacting Particle Systems ◽  
Sufficient Conditions ◽  
Explicit Construction ◽  
Particle Systems ◽  
Stochastic Comparison ◽  
Local Conditions ◽  
Jackson Networks ◽  
Finite Set ◽  
Necessary And Sufficient

We study the stochastic comparison of interacting particle systems where the state space of each particle is a finite set endowed with a partial order, and several particles may change their value at a time. For these processes we give local conditions, on the rates of change, that assure their comparability. We also analyze the case where one of the processes does not have any changes that involve several particles, and obtain necessary and sufficient conditions for their comparability. The proofs are based on the explicit construction of an order-preserving Markovian coupling. We show the applicability of our results by studying the stochastic comparison of infinite-station Jackson networks and batch-arrival, batch-service, and assemble-transfer queueing networks.

scholarly journals Stochastic Comparisons of Residual Lifetimes and Inactivity Times of Coherent Systems

2013 ◽  
Vol 50 (3) ◽  
pp. 848-860 ◽  
Author(s):  
Nitin Gupta
Keyword(s):  
Likelihood Ratio ◽  
Sufficient Conditions ◽  
Structure Functions ◽  
Coherent System ◽  
Stochastic Comparison ◽  
Coherent Systems ◽  
Stochastic Comparisons ◽  
Likelihood Ratio Ordering ◽  
Necessary And Sufficient ◽  
Residual Lifetimes

Under the assumption of independent and identically distributed (i.i.d.) components, the problem of the stochastic comparison of a coherent system having used components and a used coherent system has been considered. Necessary and sufficient conditions on structure functions have been provided for the stochastic comparison of a coherent system having used/inactive i.i.d. components and a used/inactive coherent system. As a consequence, for r-out-of-n systems, it has been shown that systems having used i.i.d. components stochastically dominate used systems in the likelihood ratio ordering.

Markovian couplings staying in arbitrary subsets of the state space

2002 ◽  
Vol 39 (01) ◽  
pp. 197-212 ◽  
Author(s):  
F. Javier López ◽  
Gerardo Sanz
Keyword(s):  
Markov Chains ◽  
State Space ◽  
Continuous Time ◽  
Sufficient Conditions ◽  
Transition Rates ◽  
Arbitrary Subset ◽  
State Spaces ◽  
Continuous Time Markov Chains ◽  
Countable State ◽  
Necessary And Sufficient

Let (X t ) and (Y t ) be continuous-time Markov chains with countable state spaces E and F and let K be an arbitrary subset of E x F. We give necessary and sufficient conditions on the transition rates of (X t ) and (Y t ) for the existence of a coupling which stays in K. We also show that when such a coupling exists, it can be chosen to be Markovian and give a way to construct it. In the case E=F and K ⊆ E x E, we see how the problem of construction of the coupling can be simplified. We give some examples of use and application of our results, including a new concept of lumpability in Markov chains.

On the Problem of Establishing the Existence of Stationary Distributions for Continuous-Time Markov Chains

1993 ◽  
Vol 7 (4) ◽  
pp. 529-543 ◽  
Author(s):  
P. K. Pollett ◽  
P. G. Taylor
Keyword(s):  
Markov Chains ◽  
Continuous Time ◽  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Transition Rates ◽  
Necessary And Sufficient Condition ◽  
Stationary Distributions ◽  
Continuous Time Markov Chains ◽  
Necessary And Sufficient ◽  
Networks Of Queues

We consider the problem of establishing the existence of stationary distributions for continuous-time Markov chains directly from the transition rates Q. Given an invariant probability distribution m for Q, we show that a necessary and sufficient condition for m to be a stationary distribution for the minimal process is that Q be regular. We provide sufficient conditions for the regularity of Q that are simple to verify in practice, thus allowing one to easily identify stationary distributions for a variety of models. To illustrate our results, we shall consider three classes of multidimensional Markov chains, namely, networks of queues with batch movements, semireversible queues, and partially balanced Markov processes.

scholarly journals Weak convergence of first-rare-event times for semi-Markov processes

2020 ◽  
Author(s):  
AISDL
Keyword(s):  
Weak Convergence ◽  
Markov Processes ◽  
Sufficient Conditions ◽  
Rare Event ◽  
Necessary And Sufficient Conditions ◽  
Finite Set ◽  
In Series ◽  
Event Times ◽  
Semi Markov Processes ◽  
Necessary And Sufficient

Necessary and sufficient conditions for weak convergence of first-rareevent times for semi-Markov processes with finite set of states in series of schemes are obtained.

Sign in / Sign up

Export Citation Format

Share Document