Related papers: Asymptotic behaviour of random tridiagonal Markov …

We characterize synchronization phenomenon in discrete-time, discrete-state random dynamical systems, with random and probabilistic Boolean networks as particular examples. In terms of multiplicative ergodic properties of the induced linear…

The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…

During the past decades, the question of existence and properties of a random attractor of a random dynamical system generated by an S(P)DE has received considerable attention, for example by the work of Gess and R\"ockner. Recently some…

The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007)…

We consider a Markov chain on $R^+$ with asymptotically zero drift and finite second moments of jumps which is positive recurrent. A power-like asymptotic behaviour of the invariant tail distribution is proven; such a heavy-tailed invariant…

This paper deals with the long term dynamics of the non-autonomous McKean-Vlasov stochastic reaction-diffusion equations on R^n. We first prove the existence and uniqueness of pullback measure attractors of the non-autonomous dynamical…

We consider the Markov random flight $\bold X(t), \; t>0,$ in the three-dimensional Euclidean space $\Bbb R^3$ with constant finite speed $c>0$ and the uniform choice of the initial and each new direction at random time instants that form a…

This paper aims at improving the convergence to equilibrium of finite ergodic Markov chains via permutations and projections. First, we prove that a specific mixture of permuted Markov chains arises naturally as a projection under the KL…

Herein, we introduce and study a new class of discrete random fields designed for quick simulation and covariance inference under inhomogeneous condition. Simulation of these correlated fields can be done in a single pass instead of relying…

We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…

When two Markov operators commute, it suggests that we can couple two copies of one of the corresponding processes. We explicitly construct a number of couplings of this type for a commuting family of Markov processes on the set of…

In the paper we consider an $\Omega$-stable 3-diffeomorphism, chain recurrent set of which consists of isolated periodic points and expanding attractors of codimension 1, orientable or not. We estimate a minimum number of isolated periodic…

Transition Path Theory (TPT) provides a rigorous statistical characterization of the ensemble of trajectories connecting directly, i.e., without detours, two disconnected (sets of) states in a Markov chain, a stochastic process that…

Ratchet models are prominent candidates to describe the transport phenomenum in nature in the absence of external bias. This work analyzes the parameter space of a discrete ratchet model and gives direct connections between chaotic domains…

We consider the moving particle process in Rd which is defined in the following way. There are two independent sequences (Tk) and (dk) of random variables. The variables Tk are non negative and form an increasing sequence, while variables…

We study the asymptotic behavior of a Markov chain on $\mathbb{Z}^2$ that corresponds to the two-dimensional marginals of a reinforcement process on $\mathbb{Z}^{\mathbb{N}}$. Three distinct asymptotic regimes are identified, depending on…

In this article we extend the coupling method from classical probability theory to quantum Markov chains on atomic von Neumann algebras. In particular, we establish a coupling inequality, which allow us to estimate convergence rates by…

In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…

Triplet Markov chains are general generative models for sequential data which take into account three kinds of random variables: (noisy) observations, their associated discrete labels and latent variables which aim at strengthening the…

This paper contributes an in-depth study of properties of continuous time Markov chains (CTMCs) on non-negative integer lattices $\N_0^d$, with particular interest in one-dimensional CTMCs with polynomial transitions rates. Such stochastic…