BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211207T093000
DTEND;TZID=America/New_York:20211207T103000
DTSTAMP:20260730T031043
CREATED:20240213T070713Z
LAST-MODIFIED:20240213T070713Z
UID:10002160-1638869400-1638873000@cmsa.fas.harvard.edu
SUMMARY:The singularity probability of random symmetric matrices
DESCRIPTION:Abstract: Let M_n be drawn uniformly from all n by n symmetric matrices with entries in {-1\,1}. In this talk I’ll consider the following basic question: what is the probability that M_n is singular? I’ll discuss recent joint work with Marcelo Campos\, Marcus Michelen and Julian Sahasrabudhe where we show that this probability is exponentially small. I hope to make the talk accessible to a fairly general audience.
URL:https://cmsa.fas.harvard.edu/event/the-singularity-probability-of-random-symmetric-matrices/
CATEGORIES:Combinatorics Physics and Probability
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Combinatorics-Physics-and-Probability-Seminar-12.07.2021.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211214T093000
DTEND;TZID=America/New_York:20211214T103000
DTSTAMP:20260730T031043
CREATED:20240213T112343Z
LAST-MODIFIED:20240304T102729Z
UID:10002495-1639474200-1639477800@cmsa.fas.harvard.edu
SUMMARY:The longest induced path in a sparse random graph
DESCRIPTION:Abstract: A long-standing problem in random graph theory has been to determine asymptotically the length of a longest induced path in sparse random graphs. Independent work of Luczak and Suen from the 90s showed the existence of an induced path of roughly half the optimal size\, which seems to be a barrier for certain natural approaches. Recently\, in joint work with Draganic and Krivelevich\, we solved this problem. In the talk\, I will discuss the history of the problem and give an overview of the proof.
URL:https://cmsa.fas.harvard.edu/event/12-14-21-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Combinatorics-Physics-and-Probability-Seminar-12.14.2021.png
END:VEVENT
END:VCALENDAR