BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIT Center for Statistics - ECPv4.5.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:MIT Center for Statistics
X-ORIGINAL-URL:https://stat.mit.edu
X-WR-CALDESC:Events for MIT Center for Statistics
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170929T110000
DTEND;TZID=America/New_York:20170929T110000
DTSTAMP:20170824T103146
CREATED:20170801T015204Z
LAST-MODIFIED:20170803T200310Z
UID:1679-1506682800-1506682800@stat.mit.edu
SUMMARY:Optimal lower bounds for universal relation\, and for samplers and finding duplicates in streams Jelani Nelson (Harvard University)
DESCRIPTION: Consider the following problem: we monitor a sequence of edgeinsertions and deletions in a graph on n vertices\, so there are N = (n choose 2) possible edges (e.g. monitoring a stream of friend accepts/removals on Facebook). At any point someone may say “query()”\, at which point must output a random edge that exists in the graph at that time from a distribution that is statistically close to uniform. More specifically\, with probability p our edge should come from a distribution close to uniform\, and with probability 1-p our sampler can do anything (i.e. it can say “Fail”\, or output a non-existent edge). The primary goal is to design an algorithm that uses very little memory. Whereas the trivial solution maintains N bits\, keeping track of which edges currently exist\, we show that the optimal space complexity for this problem is Theta(min{N\, log(1/p) * log^2(2 + N / log(1/p))}) bits. The upper bound follows by a very minor modification\nof previous work\, whereas the lower bound is our main novel contribution. \nThis is joint work with Michael Kapralov (EPFL)\, Jakub Pachocki (OpenAI)\, Zhengyu Wang (Harvard)\, David P. Woodruff (IBM Almaden)\, and Mobin Yahyazadeh (Sharif). \n
URL:https://stat.mit.edu/calendar/optimal-lower-bounds-for-universal-relation-and-for-samplers-and-finding-duplicates-in-streams/
CATEGORIES:Stochastics and Statistics Seminar
END:VEVENT
END:VCALENDAR