相关论文: Shy couplings
There are many Markov chains on infinite dimensional spaces whose one-step transition kernels are mutually singular when starting from different initial conditions. We give results which prove unique ergodicity under minimal assumptions on…
This note provides several recent progresses in the study of long time behavior of Markov processes. The examples presented below are related to other scientific fields as PDE's, physics or biology. The involved mathematical tools as…
Classical coupling constructions arrange for copies of the \emph{same} Markov process started at two \emph{different} initial states to become equal as soon as possible. In this paper, we consider an alternative coupling framework in which…
Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind…
We consider the convergence of a continuous-time Markov chain approximation X^h, h>0, to an R^d-valued Levy process X. The state space of X^h is an equidistant lattice and its Q-matrix is chosen to approximate the generator of X. In…
We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is p-synchronizing if the probability mass is at least p in a single state, or in a given set of…
We consider processes which are functions of finite-state Markov chains. It is well known that such processes are rarely Markov. However, such processes are often regular in the following sense: the distant past values of the process have…
The act of a person juggling can be viewed as a Markov process if we assume that the juggler throws to random heights. I make this association for the simplest reasonable model of random juggling and compute the steady state probabilities…
Non-positive Markov approximations are sometimes used to describe the dynamics of qubits in weak interaction with suitable environments; the appearance of negative probabilities is avoided by assuming that the transient regime eliminates…
In the investigation of limits of Markov chains, the presence of states which become instantaneous states in the limit may prevent the convergence of the chain in the Skorohod topology. We present in this article a weaker topology adapted…
Potential theory is a central tool to understand and analyse Markov processes. In this article, we develop its probabilistic counterpart for branching Markov chains. Specifically, we examine versions of quasi-processes or interlacements…
We consider the almost semi-continuous processes defined on a finite Markov chain. The representation of the moment generating functions for the absolute maximum after achievement positive level and for the recovery time are obtained.…
Coupled oscillator networks often display transitions between qualitatively different phase-locked solutions -- such as synchrony and rotating wave solutions -- following perturbation or parameter variation. In the limit of weak coupling,…
State-switching models such as hidden Markov models or Markov-switching regression models are routinely applied to analyse sequences of observations that are driven by underlying non-observable states. Coupled state-switching models extend…
Interacting particle systems are continuous time Markov processes which are used to construct models in many disciplines. Monotonicity is a property that some interacting particle systems possess. A monotone interacting particle system is…
Consider the linear stochastic differential equation (SDE) on $\mathbb{R}^n$: \[\mathrm {d}{X}_t=AX_t\,\mathrm{d}t+B\,\mathrm{d}L_t,\] where $A$ is a real $n\times n$ matrix, $B$ is a real $n\times d$ real matrix and $L_t$ is a L\'{e}vy…
Markov switching models are a popular family of models that introduces time-variation in the parameters in the form of their state- or regime-specific values. Importantly, this time-variation is governed by a discrete-valued latent…
One-shot coupling is a method of bounding the convergence rate between two copies of a Markov chain in total variation distance, which was first introduced by Roberts and Rosenthal and generalized by Madras and Sezer. The method is divided…
A Markov chain $X^i$ on a finite state space $S$ has transition matrix $P$ and initial state $i$. We may run the chains $(X^i: i\in S)$ in parallel, while insisting that any two such chains coalesce whenever they are simultaneously at the…
In this paper, we give a necessary and sufficient condition for mean stability of switched linear systems having a Markov regenerative process as its switching signal. This class of switched linear systems, which we call Markov regenerative…