BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIT Statistics and Data Science Center - ECPv5.14.2.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:MIT Statistics and Data Science Center
X-ORIGINAL-URL:https://stat.mit.edu
X-WR-CALDESC:Events for MIT Statistics and Data Science Center
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20201113T110000
DTEND;TZID=America/New_York:20201113T120000
DTSTAMP:20220528T135222
CREATED:20200901T173806Z
LAST-MODIFIED:20201020T172844Z
UID:4303-1605265200-1605268800@stat.mit.edu
SUMMARY:Sharp Thresholds for Random Subspaces\, and Applications
DESCRIPTION:Abstract: What combinatorial properties are likely to be satisfied by a random subspace over a finite field? For example\, is it likely that not too many points lie in any Hamming ball? What about any cube? We show that there is a sharp threshold on the dimension of the subspace at which the answers to these questions change from “extremely likely” to “extremely unlikely\,” and moreover we give a simple characterization of this threshold for different properties. Our motivation comes from error correcting codes\, and we use this characterization to make progress on the questions of list-decoding and list-recovery for random linear codes\, and also to establish the list-decodability of random Low Density Parity-Check (LDPC) codes. \nThis talk is based on the joint works with Venkatesan Guruswami\, Ray Li\, Jonathan Mosheiff\, Nicolas Resch\, Noga Ron-Zewi\, and Shashwat Silas. \n– \nBio: Mary Wootters is an assistant professor of Computer Science and Electrical Engineering at Stanford University. She received a PhD in mathematics from the University of Michigan in 2014\, and a BA in math and computer science from Swarthmore College in 2008; she was an NSF postdoctoral fellow at Carnegie Mellon University from 2014 to 2016. She works in theoretical computer science\, applied math\, and information theory; her research interests include error correcting codes and randomized algorithms for dealing with high dimensional data. She is the recipient of an NSF CAREER award and was named a Sloan Research Fellow in 2019; she was named to the Stanford Tau Beta Pi Teaching honor roll in 2018-19 and 2019-20.
URL:https://stat.mit.edu/calendar/wootters/
LOCATION:online
CATEGORIES:Stochastics and Statistics Seminar
END:VEVENT
END:VCALENDAR