Related papers: Two-sided estimates for order statistics of log-co…
Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…
We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…
We introduce a class of convex equivolume partitions. Expected $L_2-$discrepancy are discussed under these partitions. There are two main results. First, under this kind of partitions, we generate random point sets with smaller expected…
This article investigates sharp comparison of moments for various classes of random variables appearing in a geometric context. In the first part of our work we find the optimal constants in the Khintchine inequality for random vectors…
The paper provides an estimate of the total variation distance between distributions of polynomials defined on a space equipped with a logarithmically concave measure in terms of the $L^2$-distance between these polynomials.
This paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which…
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
We obtain the best possible upper bounds for the moments of a single order statistic from independent, non-negative random variables, in terms of the population mean. The main result covers the independent identically distributed case.…
For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…
We present two-sided estimates of moments and tails of polynomial chaoses of order at most three generated by independent symmetric random variables with log-concave tails as well as for chaoses of arbitrary order generated by independent…
In this article we consider sampling from log concave distributions in Hamiltonian setting, without assuming that the objective gradient is globally Lipschitz. We propose two algorithms based on monotone polygonal (tamed) Euler schemes, to…
In this paper we introduce a new sequence of quantities for random polytopes. Let $K_N=\conv\{X_1,...,X_N\}$ be a random polytope generated by independent random vectors uniformly distributed in an isotropic convex body $K$ of $\R^n$. We…
We show that the expectation of the $k^{\mathrm{th}}$-order statistic of an i.i.d. sample of size $n$ from a monotone reverse hazard rate (MRHR) distribution is convex in $n$ and that the expectation of the $(n-k+1)^{\mathrm{th}}$-order…
Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…
We prove that the exponent of the entropy of one dimensional projections of a log-concave random vector defines a 1/5-seminorm. We make two conjectures concerning reverse entropy power inequalities in the log-concave setting and discuss…
We provide non-asymptotic bounds for first and higher order inclusion probabilities of the rejective sampling model with various size parameters. Further we derive bounds in the semi-definite ordering for matrices that collect (conditional)…
In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…
We introduce a general framework allowing the systematic study of random manifolds. In order to do so, we will put ourselves in a more general context than usual by allowing the underlying probability space to be non commutative. We…
We show that the maximum expected inner product between a random vector and the standard normal vector over all couplings subject to a mutual information constraint or regularization is equivalent to a truncated integral involving the…
We derive an upper bound for the efficiency of estimating entries in the inverse covariance matrix of a high dimensional distribution. We show that in order to approximate an off-diagonal entry of the density matrix of a $d$-dimensional…