BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Statistical problems in complex networks - Edoardo Airoldi - Harva
 rd University\, USA
DTSTART:20100519T131500Z
DTEND:20100519T141500Z
UID:TALK24240@talks.cam.ac.uk
CONTACT:Neil Walton
DESCRIPTION:Networks are ubiquitous in science and have become a focal poi
 nt for discussion in everyday life. Formal statistical models for the anal
 ysis of network data have emerged as a major topic of interest in diverse 
 areas of study\, and most of these involve a collections of measurements o
 n pairs of objects. Probability models on graphs date back to 1959. Along 
 with empirical studies in social psychology and sociology from the 1960s\,
  these early works generated an active “network community” and a subst
 antial literature in the 1970s. This effort moved into the statistical lit
 erature in the late 1970s and 1980s\, and the past decade has seen a burge
 oning network literature in statistical physics and computer science. The 
 growth of the World Wide Web and the emergence of online “networking com
 munities” such as Facebook and LinkedIn\, and a host of more specialized
  professional network communities has intensified interest in the study of
  networks and network data.\n\nIn this talk\, I will review a few ideas th
 at are central to this burgeoning literature. I will focus on a few proble
 ms including network representation\, sampling and inference about process
 es on networks. I will conclude by describing open problems and challenges
  for machine learning and statistics.
LOCATION:Lecture Theatre 1\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR