SearcharxivSearch

arXiv subjects

Daniel J. Fresen

Publications and source records attributed to Daniel J. Fresen.

9 recordsLinked to original sources

Moment free deviation inequalities for linear combinations of independent random variables with power-type tails

We present order of magnitude estimates for the quantiles of non-negative linear combinations of non-negative random variables, as well as deviation inequalities for general linear combinations of independent random variables, under the assumption that all random variables satisfy the same power-type tail bound on $\mathbb{P}\{\left\vert X_i\right\vert>t\}$ of the form $t^{-q}$, $t^{-q/2}$ or $t^{-q/2}(\ln t)^{q/2}$, for $q>2$. The third type is applicable in the nonlinear setting. In the situations we consider, these results improve on classical estimates of Nagaev.

math.PR

Variations and extensions of the Gaussian concentration inequality, Part II

We prove concentration inequalities for $f\left( X\right) $ about its median, where $X$ is a random vector in $\mathbb{R}^n$ with independent heavy tailed coordinates of Weibull or power type, and $f:\mathbb{R}^n\rightarrow\mathbb{R}$ is a locally Lipschitz function. This paper is part of a series of four papers, Part I, Part II and two supporting papers. It can be read independently of Part I.

math.PR

Optimal tail comparison under convex majorization

Following results of Kemperman and Pinelis, we show that if $X$ and $Y$ are real valued random variables such that $\mathbb{E}\left\vert Y\right\vert<\infty$ and for all non-decreasing convex $φ:\mathbb{R}\rightarrow [0,\infty)$, $\mathbb{E}φ(X)\leq\mathbb{E}φ(Y)$, then for all $s\in\mathbb{R}$ with $\mathbb{P}\left\{Y>s\right\}\neq 0$, $\mathbb{P}\left\{X\geq\mathbb{E}\left(Y:Y>s\right)\right\}\leq\mathbb{P}\left\{Y>s\right\}$. This bound is sharp in essentially the strictest possible sense: for any such $Y$ and $s$ there exists such an $X$ with $\mathbb{P}\left\{X\geq \mathbb{E}\left(Y:Y>s\right)\right\}=\mathbb{P}\left\{Y>s\right\}$.

math.PR

Convex subsets of non-convex Lorentz balls

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the distribution of certain functions of a Gaussian random vector by approximating their sub-level sets by convex subsets.

math.FA

Variations and extensions of the Gaussian concentration inequality, Part I

The classical Gaussian concentration inequality for Lipschitz functions is adapted to a setting where the classical assumptions (i.e. Lipschitz and Gaussian) are not met. The theory is more direct than much of the existing theory designed to handle related generalizations. An application is presented to linear combinations of heavy tailed random variables.

math.PR

A simplified proof of CLT for convex bodies

We present a short proof of Klartag's central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is accessible to anyone.

math.PR

Euclidean arrangements in Banach spaces

We study the way in which the Euclidean subspaces of a Banach space fit together, somewhat in the spirit of the Kašin decomposition. The main tool that we introduce is an estimate regarding the convex hull of a convex body in John's position with a Euclidean ball of a given radius, which leads to a new and simplified proof of the randomized isomorphic Dvoretzky theorem. Our results also include a characterization of spaces with nontrivial cotype in terms of arrangements of Euclidean subspaces.

math.FA

Concentration of random polytopes around the expected convex hull

We provide a streamlined proof and improved estimates for the weak multivariate Gnedenko law of large numbers on concentration of random polytopes within the space of convex bodies (in a fixed or a high dimensional setting), as well as a corresponding strong law of large numbers.

math.PR