Finite Free Cumulants

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,900
Published on ● Video Link: https://www.youtube.com/watch?v=_QmqKEg6kVw


Duration: 48:37
308 views
3

Octavio Arizmendi (Centro de Investigación en Matemáticas, CIMAT)
https://simons.berkeley.edu/talks/undetermined-matrix-moment-problem-and-its-application-computing-zeros-l-functions
Beyond Randomized Rounding and the Probabilistic Method



Other Videos By Simons Institute for the Theory of Computing


2019-02-14Enumeration and Randomized Constructions of Hypertrees
2019-02-14Of Triangles and Intersections
2019-02-14Algorithmic Applications of Log-Concave Polynomials and High-Dimensional Expanders
2019-02-13The Geometry of Matroids
2019-02-13Completely log-concave Polynomials in Theory and Applications
2019-02-13The Space of Lorentzian Polynomials
2019-02-12Open Problems 1
2019-02-12Problems and Progress in Algorithmic Discrepancy
2019-02-12Central Limit Theorems from the Location of Roots of Probability Generating Functions
2019-02-12A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers...
2019-02-12Finite Free Cumulants
2019-02-11Developments with b− and q− Finite Free Convolutions
2019-02-11On the Further Structure of the Finite Free Convolutions
2019-02-11Convolutions of Real Stable Polynomials and Root Bounds
2019-02-11X-Ramanujan Graphs
2019-02-11Thin Trees and Interlacing Families on Strongly Rayleigh Distributions
2019-02-08Effective Arithmetic Geometry
2019-02-01Markets and Incentives for Transacting on (Personal) Information, Part III
2019-02-01Markets and Incentives for Transacting on (Personal) Information, Part I
2019-02-01Markets and Incentives for Transacting on (Personal) Information, Part II
2019-01-31Formal Methods and Proofs of Privacy Properties, Part III


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Beyond Randomized Rounding and the Probabilistic Method
Octavio Arizmendi