BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//HumTech - UCLA - ECPv5.16.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:HumTech - UCLA
X-ORIGINAL-URL:https://humtech.ucla.edu
X-WR-CALDESC:Events for HumTech - UCLA
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20160101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20160310T150000
DTEND;TZID=UTC:20160310T160000
DTSTAMP:20221003T162949
CREATED:20160305T134102Z
LAST-MODIFIED:20160305T134102Z
UID:3319-1457622000-1457625600@humtech.ucla.edu
SUMMARY:Network Analysis: Community Detection and Graphon Estimation
DESCRIPTION:Network data analysis is an important area in modern statistics. How to do community detection and parameter estimation in provably optimal ways are two key questions in analyzing network data. In this talk\, I will present results for both problems. I will first discuss a real data example that motivates the setting of a degree corrected block model. Then I will introduce an efficient two-step polynomial-time algorithm that can achieve the optimal misclassification error for community detection in this setting. The procedure consists of a novel spectral initialization step and a majority voting refinement step. I will then formulate the problem of network parameter estimation as nonparametric graphon estimation\, and establish its link to nonparametric regression without observing design. The minimax rate of graphon estimation consists of two parts: the nonparametric part and the clustering part. An interesting implication is that the smoothness of the graphon does not affect the rate once it is greater than 1.
URL:https://humtech.ucla.edu/event/network-analysis-community-detection-and-graphon-estimation/
CATEGORIES:Lecture
END:VEVENT
END:VCALENDAR