Related papers: Shy couplings
Changing time of simple continuous-time Markov counting processes by independent unit-rate Poisson processes results in Markov counting processes for which we provide closed-form transition rates via composition of trajectories and with…
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…
For Markov chains and Markov processes exhibiting a form of stochastic monotonicity (larger states shift up transition probabilities in terms of stochastic dominance), stability and ergodicity results can be obtained using order-theoretic…
The notion of "paired" fermions is central to important condensed matter phenomena such as superconductivity and superfluidity. While the concept is widely used and its physical meaning is clear there exists no systematic and mathematical…
The method of 'coupling from the past' permits exact sampling from the invariant distribution of a Markov chain on a finite state space. The coupling is successful whenever the stochastic dynamics are such that there is coalescence of all…
We prove what appears to be the first concentration of measure result for hidden Markov processes. Our bound is stated in terms of the contraction coefficients of the underlying Markov process, and strictly generalizes the Markov process…
In this paper we give general criteria on tightness and weak convergence of discrete Markov chains to symmetric jump processes on metric measure spaces under mild conditions. As an application, we investigate discrete approximation for a…
We consider a system of particles which interact through a jump process. The jump intensities are functions of the proximity rank of the particles, a type of interaction referred to as topological in the literature. Such interactions have…
This work is devoted to the almost sure stabilization of adaptive control systems that involve an unknown Markov chain. The control system displays continuous dynamics represented by differential equations and discrete events given by a…
In the last years, many authors studied a class of continuous time semi-Markov processes obtained by time-changing Markov processes by hitting times of independent subordinators. Such processes are governed by integro-differential…
We study systems of identical coupled oscillators introducing a distribution of delay times in the coupling. For arbitrary network topologies, we show that the frequency and stability of the fully synchronized states depend only on the mean…
We study Brownian flows on manifolds for which the associated Markov process is strongly mixing with respect to an invariant probability measure and for which the distance process for each pair of trajectories is a diffusion $r$. We provide…
In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available.…
We consider a random walk with a negative drift and with a jump distribution which under Cram\'er's change of measure belongs to the domain of attraction of a spectrally positive stable law. If conditioned to reach a high level and suitably…
In this paper we present elementary computations for some Markov modulated counting processes, also called counting processes with regime switching. Regime switching has become an increasingly popular concept in many branches of science. In…
Macdonald processes are certain probability measures on two-dimensional arrays of interlacing particles introduced by Borodin and Corwin (arXiv:1111.4408 [math.PR]). They are defined in terms of nonnegative specializations of the Macdonald…
It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and…
For discrete-time stochastic processes, there is a close connection between return/waiting times and entropy. Such a connection cannot be straightforwardly extended to the continuous-time setting. Contrarily to the discrete-time case one…
We start by introducing avoidance coupling of Markov chains, with an overview of existing results. We then introduce and motivate a new notion, uniform avoidance coupling. We show that the only Markovian avoidance coupling on a cycle is of…
Markov chain approximations of symmetric jump processes are investigated. Tightness results and a central limit theorem are established. Moreover, given the generator of a symmetric jump process with state space $\mathbbm{R}^d$ the…