BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20190211T140000
DTEND;TZID=Europe/Helsinki:20190211T151500
DTSTAMP:20260713T111000
CREATED:20190209T112936Z
LAST-MODIFIED:20210330T064434Z
UID:12217-1549893600-1549898100@crest.science
SUMMARY:Olga KLOPP (CREST and ESSEC) - "Graphon Estimation in cut distance" (Canceled)
DESCRIPTION:The Statistical Seminar: Every Monday at 2:00 pm. \nTime: 2:00 pm – 3:15 pm\nDate: February 11\,  2019\nPlace: Room 3001 \nOlga KLOPP (CREST and ESSEC) – “Graphon Estimation in cut distance”\nAbstract:\nWe consider the twin problems of estimating the connection probability matrix of an inhomogeneous random graph and the graphon of a W-random graph. We establish the minimax estimation rates with respect to the cut metric for classes of block constant matrices and step function graphons. Surprisingly\, our results imply that\, from the minimax point of view\, the raw data\, that is\, the adjacency matrix of the observed graph\, is already optimal and more involved procedures cannot improve the convergence rates for this metric. This phenomenon contrasts with optimal rates of convergence with respect to other classical distances for graphons. \n
URL:https://crest.science/event/olga-klopp-crest-and-essec-graphon-estimation-in-cut-distance/
CATEGORIES:Statistics
END:VEVENT
END:VCALENDAR