Related papers: Markov Process Jump Times and Their Cox Constructi…
Suppose that $(X_t)_{t \ge 0}$ is a one-dimensional Brownian motion with negative drift $-\mu$. It is possible to make sense of conditioning this process to be in the state $0$ at an independent exponential random time and if we kill the…
For Cox processes we construct a Markov process with increasing paths to couple the condensations of the Cox process in a monotone way. A similar procedure procedure yields an analogue Markov process for the P\'olya sum process. Moreover,…
In this paper a class of Ornstein--Uhlenbeck processes driven by compound Poisson processes is considered. The jumps arrive with exponential waiting times and are allowed to be two-sided. The jumps are assumed to form an iid sequence with…
In this paper, we introduce a time-continuous production model that enables random machine failures, where the failure probability depends historically on the production itself. This bidirectional relationship between historical failure…
Time change is one of the most basic and very useful transformations for Markov processes. The time changed process can also be regarded as the trace of the original process on the support of the Revuz measure used in the time change. In…
Modern methods of simulating molecular systems are based on the mathematical theory of Markov operators with a focus on autonomous equilibrated systems. However, non-autonomous physical systems or non-autonomous simulation processes are…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
In this paper we study coupled fully non-local equations, where a linear non-local operator jointly acts on the time and space variables. We establish existence and uniqueness of the solution. A maximum principle is proved and used to…
In this paper we study positive self-similar Markov processes obtained by (partially) resurrecting a strictly $\alpha$-stable process at its first exit time from $(0,\infty)$. We construct those processes by using the Lamperti transform. We…
The use of stochastic models, in effect piecewise deterministic Markov processes (PDMP), has become increasingly popular especially for the modeling of chemical reactions and cell biophysics. Yet, exact simulation methods, for the…
We consider a time inhomogeneous jump Markov process $X = (X_t)_t$ with state dependent jump intensity, taking values in $R^d . $ Its infinitesimal generator is given by \begin{multline*} L_t f (x) = \sum_{i=1}^d \frac{\partial f}{\partial…
In this paper we compute the stopping times in the game Rock-Paper-Scissors. By exploiting the recurrence relation we compute the mean values of stopping times. On the other hand, by constructing a transition matrix for a Markov chain…
We observe the continuous-time Markov Branching Process without high-order moments and allowing Immigration. Limit properties of transition functions and their convergence to invariant measures are investigated. Main mathematical tool is…
Given a stochastic structure with a filtration $\mathbb{F}$, the class of all random times whose conditional distribution functions are differentiable with respect to some $\mathbb{F}$ adapted non decreasing processes is considered. The…
We construct optimal Markov couplings of L\'{e}vy processes, whose L\'evy (jump) measure has an absolutely continuous component. The construction is based on properties of subordinate Brownian motions and the coupling of Brownian motions by…
A path decomposition at the infimum for positive self-similar Markov processes (pssMp) is obtained. Next, several aspects of the conditioning to hit 0 of a pssMp are studied. Associated to a given a pssMp $X,$ that never hits 0, we…
We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent…
We develop some sufficient conditions for the stochastic ordering between hitting times, in a fixed state, for two Markov chains. In particular, we focus attention on the so called \emph{skip-free} case. In the analysis of such a case, we…
In his 1972 paper, John Lamperti characterized all positive self-similar Markov processes as time-changes of exponentials of Levy processes. In the past decade the problem of classifying all non-negative self-similar Markov processes that…
For continuous-time ergodic Markov processes, the Kemeny time $\tau_*$ is the characteristic time needed to converge towards the steady state $P_*(x)$ : in real-space, the Kemeny time $\tau_*$ corresponds to the average of the…