University of Cambridge > Talks.cam > Statistics > Concentration and Free Probability

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Concentration and Free Probability

Download to your calendar using vCal

If you have a question about this talk, please contact Dr Sergio Bacallado .

Matrix Concentration inequalities such as Matrix Bernstein inequality have played an important role in many areas of pure and applied mathematics. These inequalities are intimately related to the celebrated noncommutative Khintchine inequality of Lust-Piquard and Pisier. In the middle of the 2010’s, Tropp improved the dimensional dependence of this inequality in certain settings by leveraging cancellations due to non-commutativity of the underlying random matrices, giving rise to the question of whether such dependency could be removed. In this talk we leverage ideas from Free Probability to fully remove the dimensional dependence in a range of instances, yielding optimal bounds in many settings of interest. As a byproduct we develop matrix concentration inequalities that capture non-commutativity (or, to be more precise, ``freeness’‘), improving over Matrix Bernstein in a range of instances. No background knowledge of Free Probability will be assumed in the talk. Joint work with March Boedihardjo and Ramon van Handel.

This talk is part of the Statistics series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

AI @ CL Events Internal Test Venue 2 The obesity epidemic: Discussing the global health crisis

Other talks

Christmas Social Evening & Annual General Meeting Chemical strategies for biomolecule functionalisation, and biomaterial conjugation Welfare Reform and the Imperative of Cooperation Title to be confirmed Title to be confirmed The Inaccessible Game
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity