相关论文: Markov Processes with Identical Bridges

A multitype continuous-state branching process (MCSBP) ${\rm Z}=({\rm Z}_{t})_{t\geq 0}$, is a Markov process with values in $[0,\infty)^{d}$ that satisfies the branching property. Its distribution is characterised by its branching…

Consider a one-sided Markov additive process with an upper and a lower barrier, where each can be either reflecting or terminating. For both defective and non-defective processes and all possible scenarios we identify the corresponding…

We obtain a new relation between the distributions $\mu_t$ at different times $t\ge 0$ of the continuous-time TASEP (Totally Asymmetric Simple Exclusion Process) started from the step initial configuration. Namely, we present a…

Let $\mu$ = ($\mu$t)t$\in$R be any 1-parameter family of probability measures on R. Its quantile process (Gt)t$\in$R : ]0, 1[ $\rightarrow$ RR, given by Gt($\alpha$) = inf{x $\in$ R : $\mu$t(]--$\infty$, x]) > $\alpha$}, is not Markov in…

We study branching Markov chains on a countable state space (space of types) $\mathscr{X}$, with the focus on the qualitative aspects of the limit behaviour of the evolving empirical population distributions. No conditions are imposed on…

Let us consider a homogeneous Markov chain with discrete time and with a finite set of states $E_0,\ldots,E_n$ such that the state $E_0$ is absorbing, states $E_1,\ldots,E_n$ are nonrecurrent. The goal of this work is to study frequencies…

Consider a continuous time particle system $\eta^t=(\eta^t(k),k\in \mathbb{L})$, indexed by a lattice $\mathbb{L}$ which will be either $\mathbb{Z}$, $\mathbb{Z}/n\mathbb{Z}$, a segment $\{1,\cdots, n\}$, or $\mathbb{Z}^d$, and taking its…

In this paper our first goal is to give precise definition of the L\'evy bridges with random length. Our second task is to establish the Markov property of this process with respect to its completed natural filtration and thus with respect…

Understanding the space-time features of how a L\'evy process crosses a constant barrier for the first time, and indeed the last time, is a problem which is central to many models in applied probability such as queueing theory, financial…

It is well-known that 0 is the absorbing state for a branching system. Each particle in the system lives a random long time and gives a random number of new particles at its death time. It stops when the system has no particle. This paper…

We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…

A continuous-time particle system on the real line satisfying the branching property and an exponential integrability condition is called a branching L\'evy process, and its law is characterized by a triplet $(\sigma^2,a,\Lambda)$. We…

The study of time-inhomogeneous Markov jump processes is a traditional topic within probability theory that has recently attracted substantial attention in various applications. However, their flexibility also incurs a substantial…

Discrete time random dynamical systems with countably many maps which admit countable Markov partitions on complete metric spaces such that the resulting Markov systems are uniform continuous and contractive are considered. A notion of a…

We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…

We prove a boundary Harnack inequality for jump-type Markov processes on metric measure state spaces, under comparability estimates of the jump kernel and Urysohn-type property of the domain of the generator of the process. The result holds…

In this paper, we establish a version of the central limit theorem for Markov-Feller continuous time processes (with a Polish state space) that are exponentially ergodic in the bounded-Lipschitz distance and enjoy a continuous form of the…

We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…

There are some positively divisible non-Markovian processes whose transition matrices satisfy the Chapman-Kolmogorov equation. These processes should also satisfy the Kolmogorov consistency conditions, an essential requirement for a process…

The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…