Free probability via entropic optimal transport
Abstract
Let μ and be probability measures on R with compact support, and let μ denote their additive free convolution. We show that for z ∈ R greater than the sum of essential suprema of μ and , we have equation* ∫-∞∞ (z - x) μ (dx) = \ E[(z - (X+Y)] - H(|μ ) \, equation* where the supremum is taken over all couplings of the probability measures μ and , and H(|μ ) denotes the relative entropy of a coupling against product measure. We prove similar formulas for the multiplicative free convolution μ and the free compression [μ]τ of probability measures, as well as for multivariate free operations. Thus the integrals of a log-potential against the fundamental measure operations of free probability may be formulated in terms of entropic optimal transport problems. The optimal couplings in these variational descriptions of the free probability operations can be computed explicitly, and from these we can then deduce the standard R- and S-transform descriptions of additive and multiplicative free convolution. We use our optimal transport formulations to derive new inequalities relating free and classical operations on probability measures, such as the inequality equation* ∫-∞∞ (z - x) μ (dx) ≥ ∫-∞∞ (z-x) μ ( dx) equation* relating free and classical convolution. Our approach is based on applying a large deviation principle on the symmetric group to the quadrature formulas of Marcus, Spielman and Srivastava.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.