Related papers: A martingale minimax exponential inequality for Ma…

Markov chain Monte Carlo algorithms are invaluable tools for exploring stationary properties of physical systems, especially in situations where direct sampling is unfeasible. Common implementations of Monte Carlo algorithms employ…

We establish lower semi-continuity and strict convexity of the energy functionals for a large class of vector equilibrium problems in logarithmic potential theory. This in particular implies the existence and uniqueness of a minimizer for…

This paper is concerned with the robustness of discrete-time Markov jump linear systems (MJLSs) with the Markov chain on a Borel space. For this general class of MJLSs, a small gain theorem is first established and subsequently applied to…

We establish, under the Cramer exponential moment condition in a neighbourhood of zero, the Extended Large Deviation Principle for the Random Walk and the Compound Poisson processes in the metric space $\V$ of functions of finite variation…

A general maximum principle (necessary and sufficient conditions) for an optimal control problem governed by a stochastic differential equation driven by an infinite dimensional martingale is established. The solution of this equation takes…

Herein, a methodology is developed to replicate functions, measures and stochastic processes onto a compact metric space. Many results are easily established for the replica objects and then transferred back to the original ones. Two…

Let $(X_i, \mathcal{F}_i)_{i\geq1}$ be a martingale difference sequence in a smooth Banach space. Let $S_n=\sum_{i=1}^nX_i, n\geq 1,$ be the partial sums of $(X_i, \mathcal{F}_i)_{i\geq 1}$. We give upper bounds on the quantity…

We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $\beta_m$ (if the sampled parts are…

Stochastic difference-of-convex (DC) optimization is prevalent in numerous machine learning applications, yet its convergence properties under small batch sizes remain poorly understood. Existing methods typically require large batches or…

We provide a method for constructing (possibly non-trivial) measures on non-locally compact Polish subspaces of infinite-dimensional separable Banach spaces which, under suitable assumptions, are minimizers of causal variational principles…

In this paper, we derive the moderate deviation principle for stationary sequences of bounded random variables with values in a Hilbert space. The conditions obtained are expressed in terms of martingale-type conditions. The main tools are…

In 1956, Dobrushin proved a definitive central limit theorem for non-homogeneous Markov chains. In this note, a shorter and different proof elucidating more the assumptions is given through martingale approximation.

General Markov chains with a countably additive transition probability in arbitrary phase space are considered. Markov operators extend from the space of countably additive measures to the space of finitely additive measures. In the…

We prove a version of McDiarmid's bounded differences inequality for Markov chains, with constants proportional to the mixing time of the chain. We also show variance bounds and Bernstein-type inequalities for empirical averages of Markov…

Comparison results for Markov processes w.r.t. function class induced (integral) stochastic orders have a long history. The most general results so far for this problem have been obtained based on the theory of evolution systems on Banach…

To deal with very large datasets a mini-batch version of the Monte Carlo Markov Chain Stochastic Approximation Expectation-Maximization algorithm for general latent variable models is proposed. For exponential models the algorithm is shown…

We consider Markov random fields of discrete spins on the lattice $\Zd$. We use a technique of coupling of conditional distributions. If under the coupling the disagreement cluster is "sufficiently" subcritical, then we prove the Poincar\'e…

Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…

We study the problem of non-asymptotic deviations between a reference measure and its empirical version, in the 1-Wasserstein metric, under the standing assumption that the measure satisfies a transport-entropy inequality. We extend some…

This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…