Related papers: A Matrix Bernstein Inequality for Strong Rayleigh …
We derive concentration inequalities for empirical means $\frac{1}{t} \int_0^t f(X_s) ds$ where $X_s$ is an irreducible Markov jump process on a finite state space and $f$ some observable. Using a Feynman-Kac semigroup we first derive a…
A generalization of the Bernstein matrix concentration inequality to random tensors of general order is proposed. This generalization is based on the use of Einstein products between tensors, from which a strong link can be established…
Bayesian nonparametric inferential procedures based on Markov chain Monte Carlo marginal methods typically yield point estimates in the form of posterior expectations. Though very useful and easy to implement in a variety of statistical…
We study fair allocation of indivisible goods when agents have matroid rank valuations. Our main contribution is a simple algorithm based on the colloquial Yankee Swap procedure that computes provably fair and efficient Lorenz dominating…
Poincar{\'e} inequalities are ubiquitous in probability and analysis and have various applications in statistics (concentration of measure, rate of convergence of Markov chains). The Poincar{\'e} constant, for which the inequality is tight,…
The concentration of empirical measures is studied for dependent data, whose joint distribution satisfies Poincar\'{e}-type or logarithmic Sobolev inequalities. The general concentration results are then applied to spectral empirical…
Markov chain Monte Carlo methods are often deemed too computationally intensive to be of any practical use for big data applications, and in particular for inference on datasets containing a large number $n$ of individual data points, also…
The purpose of this dissertation is to introduce a version of Stein's method of exchangeable pairs to solve problems in measure concentration. We specifically target systems of dependent random variables, since that is where the power of…
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…
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…
Classification is a machine learning method used in many practical applications: text mining, handwritten character recognition, face recognition, pattern classification, scene labeling, computer vision, natural langage processing. A…
In this paper, we develop a new technique which we call representation theory of the real hyperrectangle, which describes how to compute the eigenvectors and eigenvalues of certain matrices arising from hyperrectangles. We show that these…
The focus of this article is on entropy and Markov processes. We study the properties of functionals which are invariant with respect to monotonic transformations and analyze two invariant "additivity" properties: (i) existence of a…
Pseudospectral analysis serves as a powerful tool in matrix computation and the study of both linear and nonlinear dynamical systems. Among various numerical strategies, random sampling, especially in the form of rank-$1$ perturbations,…
This paper aims to provide some tools coming from functional inequalities to deal with quasi-stationarity for absorbed Markov processes. First, it is shown how a Poincar\'e inequality related to a suitable Doob transform entails exponential…
Interpolation inequalities play an essential role in Analysis with fundamental consequences in Mathematical Physics, Nonlinear Partial Differential Equations (PDEs), Markov Processes, etc., and have a wide range of applications in various…
The matrix Markov inequality by Ahlswede was stated using the Loewner anti-order between positive definite matrices. Wang use this to derive several other Chebyshev and Chernoff-type inequalities (Hoeffding, Bernstein, empirical Bernstein)…
Olkin and Shepp (2005, J. Statist. Plann. Inference, vol. 130, pp. 351--358) presented a matrix form of Chernoff's inequality for Normal and Gamma (univariate) distributions. We extend and generalize this result, proving Poincare-type and…
Many important dynamic systems, time series models or even algorithms exhibit non-strong mixing properties. In this paper, we introduce the general concept of $\mathcal{C}_{p,\mathcal{F}}$-mixing to cover such cases, where assumptions on…
We derive concentration inequalities for functions of the empirical measure of large random matrices with infinitely divisible entries and, in particular, stable ones. We also give concentration results for some other functionals of these…