BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250728T185629EDT-90657lZVa0@132.216.98.100
DTSTAMP:20250728T225629Z
DESCRIPTION:High Dimensions\, Inference and Combinatorics. A Journey Throug
 h the Data Jungle\n\nThis talk takes us on a journey through modern high-d
 imensional statistics. We begin with a brief discussion on variable select
 ion and estimation and the challenges they bring to high-dimensional infer
 ence\, and we formulate a new family of inferential problems for graphical
  models. Our aim is to conduct hypothesis tests on graph properties such a
 s connectivity\, maximum degree and cycle presence. The testing algorithms
  we introduce are applicable to properties which are invariant under edge 
 addition. In parallel\, we also develop a minimax lower bound showing the 
 optimality of our tests over a broad family of graph properties. We apply 
 our methods to study neuroimaging data.\n
DTSTART:20170124T203000Z
DTEND:20170124T213000Z
LOCATION:Purvis Hall\, CA\, QC\, Montreal\, H3A 1A2\, 1020 avenue des Pins 
 Ouest
SUMMARY:Matey N. Neykov\, ORFE\, Princeton University
URL:/mathstat/channels/event/matey-n-neykov-orfe-princ
 eton-university-265229
END:VEVENT
END:VCALENDAR