University of Cambridge > Talks.cam > Causal Inference Reading Group > The singularity probability of a random symmetric matrix is exponentially small

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

The singularity probability of a random symmetric matrix is exponentially small

Download to your calendar using vCal

  • UserMarcelo Campos (IMPA, Brazil)
  • ClockThursday 05 May 2022, 14:30-15:30
  • HouseMR12.

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 lists

Lecture Theatre LT0, Department of Engineering Johnson Matthey Lecture Theatre, Department of Chemical Engineering & Biotechnology, Philippa Fawcett Drive, Cambridge CB3 0AS Omoluabipoint22

Other talks

Royal Papworth Hospital and Acute Medicine An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Title to be confirmed Quantum graphs with a time asymmetry: spectral optimization and spectral statistics Synthesizing Diverse Policies for Multi-Agent Coordination TBC
 

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