Related papers: On the infimum convolution inequalities with impro…
We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…
We present a class of modified logarithmic Sobolev inequality, interpolating between Poincar\'e and logarithmic Sobolev inequalities, suitable for measures of the type $\exp(-|x|^\al)$ or more complex $\exp(-|x|^\al\log^\beta(2+|x|))$…
The purpose of this short note is to demonstrate uniform logarithmic Sobolev inequalities for the mean field gradient particle systems associated to an energy functional that is convex in the flat sense. A defective log-Sobolev inequality…
The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…
This note has a twofold purpose. To improve the best known lower estimates of the Hardy-Littlewood inequality for $m$-linear forms in $\ell_{p}$ spaces and to provide a closed formula encompassing the cases $p>2m$ and $% p=2m.$ Our approach…
In this note, among other results, we find the optimal constants of the generalized Bohnenblust--Hille inequality for $m$-linear forms over $\mathbb{R}$ and with multiple exponents $\left( 1,2,...,2\right) $, sometimes called mixed $\left(…
TheL2-gain characterizes a dynamical system's input-output properties, but can be difficult to determine for nonlinear systems. Previous work designed a nonconvex optimization problem to simultaneously search for a continuous piecewise…
We discuss situations where perturbing a probability measure on $\mathbb{R}^n$ does not deteriorate its Poincar\'e constant by much. A particular example is the symmetric exponential measure in $\mathbb{R}^n$, even log-concave perturbations…
We establish transportation cost inequalities (TCI) with respect to the quantum Wasserstein distance by introducing quantum extensions of well-known classical methods: first, using a non-commutative version of Ollivier's coarse Ricci…
This note reviews the studies of the last decades emphasizing a common principle based on entropy, logarithmic Sobolev inequality and hypercontractivity, behind four most celebrated inequalities by M. Talagrand: the convex distance…
The Conway-Maxwell-Poisson distribution is a two-parameter generalisation of the Poisson distribution that can be used to model data that is under- or over-dispersed relative to the Poisson distribution. The normalizing constant…
Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistics. In this work, we consider the problem of estimating the…
We give a characterization of transport-entropy inequalities in metric spaces. As an application we deduce that such inequalities are stable under bounded perturbation (Holley-Stroock perturbation Lemma).
We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic…
The lace expansion for the Ising two-point function was successfully derived in Sakai (Commun. Math. Phys., 272 (2007): 283--344). It is an identity that involves an alternating series of the lace-expansion coefficients. In the same paper,…
Isotropic $\alpha$-stable distributions are central in the theory of heavy-tailed distributions and play a role similar to that of the Gaussian density among finite second-moment laws. Given a sequence of $n$ observations, we are interested…
We study the asymptotic convergence of solutions as $t\rightarrow\infty$ of $\partial_t u=-f(u)+\int f(u)$, a nonlocal differential equation that is formally a gradient flow in a constant-mass subspace of $L^2$ arising from simplified…
A canonical algorithm for log-concave sampling is the Langevin Algorithm, aka the Langevin Diffusion run with some discretization stepsize $\eta > 0$. This discretization leads the Langevin Algorithm to have a stationary distribution…
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…
We extend to the multilinear setting classical inequalities of Marcinkiewicz and Zygmund on $\ell^r$-valued extensions of linear operators. We show that for certain $1 \leq p, q_1, \dots, q_m, r \leq \infty$, there is a constant $C\geq 0$…