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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20190503T110000
DTEND;TZID=America/New_York:20190503T120000
DTSTAMP:20220528T122327
CREATED:20190204T203453Z
LAST-MODIFIED:20200102T154410Z
UID:3139-1556881200-1556884800@stat.mit.edu
SUMMARY:Optimal Adaptivity of Signed-Polygon Statistics for Network Testing (Tracy Ke\, Harvard University)
DESCRIPTION:Abstract:\nGiven a symmetric social network\, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity\, (b) accommodate mixed-memberships\, (c) have a tractable null distribution\, and (d) adapt automatically to different levels of sparsity\, and achieve the optimal detection boundary. How to find such a test is a challenging problem. \nWe propose the Signed Polygon as a class of new tests. Fix m ≥ 3. For each m-gon in the network\, we define a score using the centralized adjacency matrix. The sum of such scores is then the m-th order Signed Polygon statistic. The Signed Triangle (SgnT) and the Signed Quadrilateral (SgnQ) are special examples of the Signed Polygon. We show that both the SgnT and SgnQ tests satisfy all the requirements (a)-(d). Especially\, they work well for both the very sparse and less sparse cases. Our proposed tests compare favorably with the existing tests. For example\, the EZ test (Gao and Lafferty\, 2017) and GC test (Jin et al\, 2018) behave unsatisfactorily in the less sparse case and do not achieve the optimal phase diagram. Also\, many existing tests assume no heterogeneity or mixed-memberships\, so they behave unsatisfactorily in our settings. \nThe analysis of the SgnT and SgnQ tests is delicate and tedious\, since the proof has to cover a whole range of sparsity levels and (almost) arbitrary degree heterogeneity. \nJoint work with Jiashun Jin and Shengming Luo. (arXiv preprint: https://arxiv.org/abs/1904.09532) \nBiography:\nTracy Ke is Assistant Professor of Statistics in Harvard University. Dr. Ke received her PhD from Princeton University in 2014. She was Assistant Professor of Statistics in The University of Chicago from 2014 to 2018. Her recent research focuses on unsupervised learning problems\, including spectral clustering\, network community detection\, topic modeling\, and nonnegative matrix factorization. Her works aim to find statistically optimal methods when the signals are extremely weak and when the data contains severe heterogeneity. Her other research interests include large-scale sparse inference and random matrix theory.
URL:https://stat.mit.edu/calendar/tracyke/
LOCATION:E18-304\, United States
CATEGORIES:Stochastics and Statistics Seminar
GEO:42.3620185;-71.0878444
END:VEVENT
END:VCALENDAR