COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Causal Inference Reading Group > The singularity probability of a random symmetric matrix is exponentially small
The singularity probability of a random symmetric matrix is exponentially smallAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Leader. This talk has been canceled/deleted Let A be drawn uniformly at random from the set of all n by n symmetric matrices with entries in −1,1. I’ll describe some recent work where we show that the probability that A is singular is at most e^(-cn), for some absolute constant c>0. Joint work with Matthew Jenssen, Marcus Michelen and Julian Sahasrabudhe. This talk is part of the Causal Inference Reading Group series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsWolfson Informal Lunchtime Seminar Series Cambridge RNA ClubOther talksStatistics Clinic Summer 2022 IV Earthquake ground-motion assessment and rupture behaviours of induced seismicity from deep geothermal production Another characterization of nilpotent blocks Understanding Myc Transcription Modeling ‘The Dawn of Everything’: how simulating a complex yesterday might (or might not) help us with a complicated tomorrow |