BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Edge exchangeability: a new foundation for modeling network data -
  Harry Crane (Rutgers\, The State University of New Jersey)
DTSTART:20160725T123000Z
DTEND:20160725T130000Z
UID:TALK66839@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:Exchangeable models for vertex labeled graphs cannot replicate
  the large  sample behaviors of sparsity and power law degree distribution
 s observed in many  network datasets. To address this issue\, we introduce
  the principle of edge  exchangeability\, which is more natural for most a
 pplications and admits models  for networks with sparse and/or power law s
 tructure. The vertices in an edge  exchangeable network arrive in size-bia
 sed order according to their degree\,  further explaining why vertex excha
 ngeability is an untenable assumption for  many applications. <br> <br>Our
  discussion settles a longstanding question of statistical network  modeli
 ng and presents a new framework within which to develop future theory and 
  methods. <br> <span><br>Joint work with Walter Dempsey.</span>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR