BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261103T175137
DTSTART;TZID=America/Detroit:20261118T160000
DTEND;TZID=America/Detroit:20261118T170000
SUMMARY:Workshop / Seminar:Recovering Geometry from Random Graphs
DESCRIPTION:How much geometry can be recovered from a random graph? Consider points sampled from an unknown space\, with edges drawn independently according to a function of the distance between their endpoints. I will discuss a sequence of results on efficient reconstruction when the underlying space is a manifold\, including results for sparse graphs and for unknown connection functions.  I will also explain what makes manifold geometry special and illustrate the information-theoretic obstructions that arise in more general metric spaces.\nBased on joint work with Pakawut Jiradilok and Elchanan Mossel.
UID:154512-21917882@events.umich.edu
URL:https://events.umich.edu/event/154512
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
END:VCALENDAR