Related papers: Bernstein type's concentration inequalities for sy…
We establish Bernstein's inequalities for functions of general (general-state-space and possibly non-reversible) Markov chains. These inequalities achieve sharp variance proxies and encompass the classical Bernstein inequality for…
For general penalized Markov processes with soft killing, we propose a simple criterion ensuring uniform convergence of conditional distributions in Wasserstein distance to a unique quasi-stationary distribution. We give several examples of…
We prove that in the context of general Markov semigroups Beckner inequalities with constants separated from zero as $p\to 1^+$ are equivalent to the modified log Sobolev inequality (previously only one implication was known to hold in this…
Information-theory based variational principles have proven effective at providing scalable uncertainty quantification (i.e. robustness) bounds for quantities of interest in the presence of nonparametric model-form uncertainty. In this…
We introduce a class of Markov chains, that contains the model of stochastic approximation by averaging and non-averaging. Using martingale approximation method, we establish various deviation inequalities for separately Lipschitz functions…
In this work we derive multi-level concentration inequalities for polynomial functions in independent random variables with a $\alpha$-sub-exponential tail decay. A particularly interesting case is given by quadratic forms $f(X_1, \ldots,…
Let $X=(X_t)_{t\geq 0}$ be a known process and $T$ an unknown random time independent of $X$. Our goal is to derive the distribution of $T$ based on an iid sample of $X_T$. Belomestny and Schoenmakers (2015) propose a solution based the…
In this paper we use a Malliavin-Stein type method to investigate Poisson and normal approximations for the measurable functions of infinitely many independent random variables. We combine Stein's method with the difference operators in…
Matrix concentration inequalities provide information about the probability that a random matrix is close to its expectation with respect to the $l_2$ operator norm. This paper uses semigroup methods to derive sharp nonlinear matrix…
We consider two examples for a well-known method for obtaining concentration of measure (COM) bounds for a given observable in a given measure. The method is to consider an auxiliary Markov chain for which the invariant distribution is the…
The $L^1$ transport-entropy inequality (or $T_1$ inequality), which bounds the $1$-Wasserstein distance in terms of the relative entropy, is known to characterize Gaussian concentration. To extend the $T_1$ inequality to laws of…
This survey discusses the classical Bernstein and Markov inequalities for the derivatives of polynomials, as well as some of their extensions to general sets.
There is a lack of methodological results for continuous time change detection due to the challenges of noninformative prior specification and efficient posterior inference in this setting. Most methodologies to date assume data are…
Asymptotically sharp Bernstein- and Markov-type inequalities are established for rational functions on $C^2$ smooth Jordan curves and arcs. The results are formulated in terms of the normal derivatives of certain Green's functions with…
Consider an ergodic stationary random field $A$ on the ambient space $\mathbb R^d$. In order to establish concentration properties for nonlinear functions $Z(A)$, it is standard to appeal to functional inequalities like Poincar\'e or…
The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…
We give a survey of recent results, due mainly to the authors, concerning Bernstein-Markov type inequalities and connections with potential theory.
One way to define the concentration of measure phenomenon is via Talagrand inequalities, also called transportation-information inequalities. That is, a comparison of the Wasserstein distance from the given measure to any other absolutely…
We provide a sharp nonasymptotic analysis of the rates of convergence for some standard multivariate Markov chains using spectral techniques. All chains under consideration have multivariate orthogonal polynomial as eigenfunctions. Our…
We prove that probability laws of certain multidimensional semimartingales which includes time-inhomogenous diffusions, under suitable assumptions, satisfy Quadratic Transportation Cost Inequality under the uniform metric. From this we…