BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graphons and Graphexes as Limits of Sparse Graphs: Part I - Jennif
 er Chayes (Microsoft Research New England)
DTSTART:20180405T133000Z
DTEND:20180405T143000Z
UID:TALK103330@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Graphons and graphexes are limits of graphs which allow us\nto
  model and estimate properties of large-scale networks. In this pair of ta
 lks\, we review the theory of dense graph limits\, and give two alternativ
 e theories for limits of sparse graphs: one leading to unbounded graphons 
 over probability spaces\, and the other leading to bounded graphons (and g
 raphexes) over sigma-finite measure spaces.\n\nTalk I\, to be given by Jen
 nifer Chayes\, will review the general theory\, highlight the unbounded gr
 aphons\, and show how they can be used to consistently estimate properties
  of large sparse networks. This talk will also give an application of thes
 e sparse graphons to collaborative filtering on sparse bipartite networks.
 \n
LOCATION:MR12
END:VEVENT
END:VCALENDAR