Related papers: Subgaussian concentration inequalities for geometr…

In this paper we study ergodic backward stochastic differential equations (EBSDEs) dropping the strong dissipativity assumption needed in the previous work. In other words we do not need to require the uniform exponential decay of the…

It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…

We prove explicit error bounds for Markov chain Monte Carlo (MCMC) methods to compute expectations of functions with unbounded stationary variance. We assume that there is a $p\in(1,2)$ so that the functions have finite $L_p$-norm. For…

In this article, we pay attention to transitive dynamical systems having the shadowing property and the entropy functions are upper semicontinuous. As for these dynamical systems, when we consider ergodic optimization restricted on the…

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…

It is shown that a seemingly harmless reordering of the steps in a block Gibbs sampler can actually invalidate the algorithm. In particular, the Markov chain that is simulated by the "out-of-order" block Gibbs sampler does not have the…

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

We study the ergodic properties of finite-dimensional systems of SDEs driven by non-degenerate additive fractional Brownian motion with arbitrary Hurst parameter $H\in(0,1)$. A general framework is constructed to make precise the notions of…

Let $X_n$ be a discrete time Markov chain with state space $S$ (countably infinite, in general) and initial probability distribution $\mu^{(0)} = (P(X_0=i_1),P(X_0=i_2),\cdots,)$. What is the probability of choosing in random some $k \in…

We prove an invariance principle (functional central limit theorem) for a vector-valued additive functional of a Markov chain for almost every starting point with respect to an ergodic equilibrium distribution. The hypothesis is a moment…

We prove explicit, i.e. non-asymptotic, error bounds for Markov chain Monte Carlo methods. The problem is to compute the expectation of a function f with respect to a measure {\pi}. Different convergence properties of Markov chains imply…

We prove that if a topological dynamical system is mean sensitive and contains a mean proximal pair consisting of a transitive point and a periodic point, then it is mean Li-Yorke chaotic (DC2 chaotic). On the other hand we show that a…

We address the problem of upper bounding the mean square error of MCMC estimators. Our analysis is nonasymptotic. We first establish a general result valid for essentially all ergodic Markov chains encountered in Bayesian computation and a…

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

This paper studies the subgeometric convergence of the stationary distribution in taking the infinite-level limit of a finite-level M/G/1-type Markov chain, that is, in letting the upper boundary level go to infinity. This study is…

We prove that every Markov solution to the three dimensional Navier-Stokes equation with periodic boundary conditions driven by additive Gaussian noise is uniquely ergodic. The convergence to the (unique) invariant measure is exponentially…

We prove that any continuous and convex stationary ergodic Hamiltonian admits critical subsolutions, which are strict outside the random Aubry set. They make up, in addition, a dense subset of all critical subsolutions with respect to a…

We study conservative particle systems on W^S, where S is countable and W = {0, ..., N} or the natural numbers. The rate of a particle moving from site x to site y is given by p(x,y) b(eta_x, eta_y), where eta_z is the number of particles…

Motivated by a model presented by S. Gudder, we study a quantum generalization of Markov chains and discuss the relation between these maps and open quantum random walks, a class of quantum channels described by S. Attal et al. We consider…

A Markov decision problem is called reversible if the stationary controlled Markov chain is reversible under every stationary Markovian strategy. A natural application in which such problems arise is in the control of Metropolis-Hastings…