Free transport-entropy inequalities for non-convex potentials and application to concentration for random matrices
Myl\`ene Ma\"ida (LM-Orsay), \'Edouard Maurel-Segala (LM-Orsay)

TL;DR
This paper establishes free transport-entropy inequalities for non-convex potentials, extending classical results to free probability and applying them to concentration phenomena in random matrix theory.
Contribution
It proves free transport-entropy inequalities for non-convex potentials, broadening the scope beyond convex cases and enabling new concentration results for random matrices.
Findings
Proved free transport-entropy inequalities for a class of non-convex measures.
Derived concentration estimates for $eta$-ensembles under mild potential assumptions.
Extended classical inequalities to the free probability setting beyond convex potentials.
Abstract
Talagrand's inequalities make a link between two fundamentals concepts of probability: transport of measures and entropy. The study of the counterpart of these inequalities in the context of free probability has been initiated by Biane and Voiculescu and later extended by Hiai, Petz and Ueda for convex potentials. In this work, we prove a free analogue of a result of Bobkov and G\"otze in the classical setting, thus providing free transport-entropy inequalities for a very natural class of measures appearing in random matrix theory. These inequalities are weaker than the ones of Hiai, Petz and Ueda but still hold beyond the convex case. We then use this result to get a concentration estimate for -ensembles under mild assumptions on the potential.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Point processes and geometric inequalities · Graph theory and applications
