相关论文: Inequalities related to free entropy derived from …

We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…

Let $q(x)$ and $p(x)$ denote density functions on the $n$-dimensional Euclidean space, and let $p_i(\cdot|y_1,..., y_{i-1},y_{i+1},..., y_n)$ and $Q_i(\cdot|x_1,..., x_{i-1},x_{i+1},..., x_n)$ denote their local specifications. For a class…

We prove a central limit theorem for the entropic transportation cost between subgaussian probability measures, centered at the population cost. This is the first result which allows for asymptotically valid inference for entropic optimal…

We derive transport-entropy inequalities for mixed binomial point processes, and for Poisson point processes. We show that when the finite intensity measure satisfies a Talagrand transport inequality, the law of the point process also…

We develop in this paper an amelioration of the method given by S. Bobkov and M. Ledoux in GAFA (2000). We prove by Prekopa-Leindler Theorem an optimal modified logarithmic Sobolev inequality adapted for all log-concave measure on $\dR^n$.…

We develop connections between Stein's approximation method, logarithmic Sobolev and transport inequalities by introducing a new class of functional inequalities involving the relative entropy, the Stein kernel, the relative Fisher…

This work is devoted to direct mass transportation proofs of families of functional inequalities in the context of one-dimensional free probability, avoiding random matrix approximation. The inequalities include the free form of the…

We define a classical probability analogue of Voiculescu's free entropy dimension that we shall call the classical probability entropy dimension of a probability measure on $\mathbb{R}^n$. We show that the classical probability entropy…

We develop in this paper an improvement of the method given by S. Bobkov and M. Ledoux. Using the Pr\'ekopa-Leindler inequality, we prove a modified logarithmic Sobolev inequality adapted for all measures on $\dR^n$, with a strictly convex…

In this article, we aim to define a Boolean entropy notion parallel to the framework of free entropy proposed by Voiculescu. Motivated by the work of Lenczewski and the work of C\'ebron & Gillers, we mainly investigated two random matrix…

We show that there is a sharp threshold in dimension one for the transport cost between the Lebesgue measure $\lambda$ and an invariant random measure $\mu$ of unit intensity to be finite. We show that for \emph{any} such random measure the…

We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…

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…

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…

We give by simple arguments sufficient conditions, so called Lyapunov conditions, for Talagrand's transportation information inequality and for the logarithmic Sobolev inequality. Those sufficient conditions work even in the case where the…

We give a short proof of the free analogue of the Talagrand inequality for the transportation cost to the semicircular which was originally proved by Biane and Voiculescu. The proof is based on a convexity argument and is in the spirit of…

In this paper we discuss the natural candidate for the one dimensional free Poincar\'e inequality. Two main strong points sustain this candidacy. One is the random matrix heuristic and the other the relations with the other free functional…

We give here a simple proof of weighted logarithmic Sobolev inequality, for example for Cauchy type measures, with optimal weight, sharpening results of Bobkov-Ledoux. Some consequences are also discussed.

We prove a log-Sobolev inequality for a certain class of log-concave measures in high dimension. These are the probability measures supported on the unit cube in R^n whose density takes the form exp(-H) where the function H is assumed to be…