Related papers: On Convex Functions of Gaussian Variables

We present a new method for proving the norm concentration inequality of sub-Gaussian variables. Our proof is based on an averaged version of the moment generating function, termed the averaged moment generating function. Our method applies…

We obtain a sharp characterization of the Euclidean ball among all convex bodies K whose boundary has a pointwise k-th mean curvature not smaller than a geometric constant at almost all normal points. This geometric constant depends only on…

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

We study random surfaces with a uniformly convex gradient interaction in the presence of quenched disorder taking the form of a random independent external field. Previous work on the model has focused on proving existence and uniqueness of…

We prove a sharp lower bound for the fundamental gap on convex domains in Gaussian spaces, the difference between the first two eigenvalues of the Ornstein-Uhlenbeck operator with Dirichlet boundary conditions. Our main result establishes…

This paper studies the convexity properties of nonsmooth extended-real-valued weakly convex functions, a class of functions that is central to modern optimization and its applications. We establish new characterizations of convexity using…

It is well known that nonlinear diffusion equations can be interpreted as a gradient flow in the space of probability measures equipped with the Euclidean Wasserstein distance. Under suitable convexity conditions on the nonlinearity, due to…

Chaining techniques show that if X is an isotropic log-concave random vector in R^n and Gamma is a standard Gaussian vector then E |X| < C n^{1/4} E |Gamma| for any norm |*|, where C is a universal constant. Using a completely different…

The dynamics of probability density functions have been extensively studied in computational science and engineering to understand physical phenomena and facilitate algorithmic design. Of particular interest are dynamics formulated as…

Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…

In this paper, we consider the mean curvature flow of convex hypersurfaces in Euclidean spaces with a general forcing term. We show that the flow may shrink to a point in finite time if the forcing term is small, or exist for all times and…

This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related…

Some geometric properties of a normalized hyper-Bessel functions are investigated. Especially we focus on the radii of starlikeness, convexity, and uniform convexity of hyper-Bessel functions and we show that the obtained radii satisfy some…

We prove that for Gaussian random normal matrices the correlation function has universal behavior. Using the technique of orthogonal polynomials and identities similar to the Christoffel-Darboux formula, we find that in the limit, as the…

In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…

Let R+ = (0,infinity) and let M be the family of all mean values of two numbers in R+ (some examples are the arithmetic, geometric, and harmonic means). Given m1, m2 in M, we say that a function f : R+ to R+ is (m1,m2)-convex if f(m1(x,y))…

Given a probability measure $\mu$ supported on a convex subset $\Omega$ of Euclidean space $(\mathbb{R}^d,g_0)$, we are interested in obtaining Poincar\'e and log-Sobolev type inequalities on $(\Omega,g_0,\mu)$. To this end, we change the…

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of…

The variance conjecture in Asymptotic Convex Geometry stipulates that the Euclidean norm of a random vector uniformly distributed in a (properly normalised) high-dimensional convex body $K\subset {\mathbb R}^n$ satisfies a Poincar\'e-type…

Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne…