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:TALK23760@talks.cam.ac.uk
CONTACT:Stephen Clark
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\ninterest in diverse
  areas of study\, and most of these involve a collections of measurements 
 on pairs of objects. Probability models on graphs date back to 1959. Along
  with empirical studies in social\npsychology and sociology from the 1960s
 \, these early works generated an active “network community” and a sub
 stantial literature in the 1970s. This effort moved into the statistical l
 iterature in the late\n1970s and 1980s\, and the past decade has seen a bu
 rgeoning network literature in statistical physics and computer science. T
 he growth of the World Wide Web and the emergence of online “networking\
 ncommunities” such as Facebook and LinkedIn\, and a host of more special
 ized professional network communities has intensified interest in the stud
 y of networks and network data.\n\nIn this talk\, I will review a few idea
 s that are central to this burgeoning literature. I will focus on a few pr
 oblems including network representation\, sampling and inference about pro
 cesses on networks. I\nwill conclude by describing open problems and chall
 enges for machine learning and statistics.
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR