BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNC Statistics & Operational Research - ECPv5.16.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UNC Statistics & Operational Research
X-ORIGINAL-URL:https://stor.unc.edu
X-WR-CALDESC:Events for UNC Statistics & Operational Research
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Halifax
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20150308T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20151101T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20150330T153000
DTEND;TZID=America/Halifax:20150330T163000
DTSTAMP:20220817T141110
CREATED:20170215T181322Z
LAST-MODIFIED:20170215T181322Z
UID:9701-1427729400-1427733000@stor.unc.edu
SUMMARY:Hotelling Lecture: Yuval Peres\, Microsoft Research
DESCRIPTION:Local Partitioning and hidden Cliques in Massive Graphs \nA local partitioning algorithm finds a “community” for a given node in a large graph (i.e.\, a set of nodes with relatively few bonds to the outside) by examining only a small part of the entire graph. I will describe the “evolving set” partitioning algorithm\, developed jointly with Reid Andersen\, which is based on earlier work with Ben Morris on mixing times for Markov chains. In the second part of the talk\, I’ll present progress on the “hidden clique” problem: locating a fully connected “clique” in a typical dense graph on n nodes. Currently\, cliques can be found in polynomial time only if their size exceeds the square root of n. The first technique to do this\, analyzed by Alon et al\, was spectral; in joint work with Yael Dekel and Ori Gurel-Gurevich\, we found the first algorithm that identifies the hidden clique in quadratic time with high probability. Perhaps surprisingly\, it is simpler. Whether smaller hidden cliques (e.g.\, of size the cube root of n) can be detected remains a tantalizing open problem. \nReception at 4:30pm in the 3rd floor lounge of Hanes Hall \nYoutube videos: Lec1_1\, Lec1_2
URL:https://stor.unc.edu/event/hotelling-lecture-yuval-peres-microsoft-research/
LOCATION:120 Hanes Hall\, Hanes Hall\, Chapel Hill\, NC\, 27599\, United States
CATEGORIES:Hotelling Lectures
END:VEVENT
END:VCALENDAR