English
Related papers

Related papers: Free probability via entropic optimal transport

200 papers

Given two compact metric spaces $X$ and $Y$, a Lipschitz continuous cost function $c$ on $X \times Y$ and two probabilities $\mu \in\mathcal{P}(X),\,\nu\in\mathcal{P}(Y)$, we propose to study the Monge-Kantorovich problem and its duality…

Dynamical Systems · Mathematics 2025-02-03 Jairo K. Mengue

We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…

Operator Algebras · Mathematics 2021-04-13 Ethan Davis , David Jekel , Zhichao Wang

We derive a formula for the moments and the free cumulants of the multiplication of $k$ free random variables in terms of $k$-equal and $k$-divisible non-crossing partitions. This leads to a new simple proof for the bounds of the right-edge…

Operator Algebras · Mathematics 2012-02-28 Octavio Arizmendi , Carlos Vargas

Given ergodic p-invariant measures {\mu_i} on the 1-torus T=R/Z, we give a sharp condition on their entropies, guaranteeing that the entropy of the convolution \muon converges to \log p. We also prove a variant of this result for joinings…

Dynamical Systems · Mathematics 2009-09-25 Elon Lindenstrauss , David Meiri , Yuval Peres

This work proposes algorithms for computing additive and multiplicative free convolutions of two given measures. We consider measures with compact support whose free convolution results in a measure with a density function that exhibits a…

Numerical Analysis · Mathematics 2023-05-04 Alice Cortinovis , Lexing Ying

Let $\pi:X\to Y$ be a factor map, where $(X,\sigma_X)$ and $(Y,\sigma_Y)$ are subshifts over finite alphabets. Assume that $X$ satisfies weak specification. Let $\ba=(a_1,a_2)\in \R^2$ with $a_1>0$ and $a_2\geq 0$. Let $f$ be a continuous…

Dynamical Systems · Mathematics 2009-09-24 De-Jun Feng

Let k be a positive integer and let D_k denote the space of joint distributions for k-tuples of selfadjoint elements in C*-probability space. The paper studies the concept of "subordination distribution of \mu \boxplus \nu with respect to…

Operator Algebras · Mathematics 2008-10-30 Alexandru Nica

Non-additive measures, also known as fuzzy measures, capacities, and monotonic games, are increasingly used in different fields. Applications have been built within computer science and artificial intelligence related to e.g. decision…

Artificial Intelligence · Computer Science 2022-12-09 Vicenç Torra

The classical (overdamped) Langevin dynamics provide a natural algorithm for sampling from its invariant measure, which uniquely minimizes an energy functional over the space of probability measures, and which concentrates around the…

Probability · Mathematics 2023-09-26 Giovanni Conforti , Daniel Lacker , Soumik Pal

In this paper we give an analytic interpretation of free convolution of type B, introduced by Biane, Goodman and Nica, and provide a new formula for its computation. This formula allows us to show that free additive convolution of type B is…

Operator Algebras · Mathematics 2012-06-12 S. T. Belinschi , D. Shlyakhtenko

There are interesting extensions of the problem of determining a joint probability with known marginals. On the one hand, one may impose size constraints on the joint probabilities. On the other, one may impose additional constraints like…

Probability · Mathematics 2021-09-08 Henryk Gzyl

Let $M,N$ be two smooth compact hypersurfaces of $\mathbb{R}^n$ which bound strictly convex domains equipped with two absolutely continuous measures $\mu$ and $\nu$ (with respect to the volume measures of $M$ and $N$). We consider the…

Differential Geometry · Mathematics 2015-07-10 Emmanuel Humbert , Luc Molinet

Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…

Number Theory · Mathematics 2025-03-21 Akshat Mudgal

The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…

Probability · Mathematics 2022-03-10 Sinho Chewi , Aram-Alexandre Pooladian

Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…

Optimization and Control · Mathematics 2024-05-01 Jean-Bernard Lasserre

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…

Combinatorics · Mathematics 2026-04-30 Lampros Gavalakis , Marcel K. Goh , Ioannis Kontoyiannis

We develop analytic tools for studying the free multiplicative convolution of any measure on the real line and any measure on the nonnegative real line. More precisely, we construct the subordination functions and the $S$-transform of an…

Probability · Mathematics 2026-04-21 Octavio Arizmendi , Takahiro Hasebe , Yu Kitagawa

We present an alternative approach to the theory of free Gibbs states with convex potentials. Instead of solving SDE's, we combine PDE techniques with a notion of asymptotic approximability by trace polynomials for a sequence of functions…

Operator Algebras · Mathematics 2020-12-30 David Jekel

Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…

Combinatorics · Mathematics 2025-01-10 Gregory Baimetov , Ryan Bushling , Ansel Goh , Raymond Guo , Owen Jacobs , Sean Lee

We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\mu$, admits a density over $\mathbb{R}^d$. For a semi-concave cost function…

Optimization and Control · Mathematics 2025-07-21 Lénaïc Chizat , Alex Delalande , Tomas Vaškevičius