BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Looptrees - Kortchemski\, I (CNRS (Centre national de la recherche
  scientifique))
DTSTART:20150421T143000Z
DTEND:20150421T153000Z
UID:TALK59141@talks.cam.ac.uk
CONTACT:42080
DESCRIPTION:A looptree of a plane tree is the graph obtained by replacing 
 each vertex of the tree by a discrete loop of length equal to its degree\,
  and by gluing these loops according to the tree structure. We will be int
 erested in the scaling limits\, for the Gromov-Hausdorff topology\, of loo
 ptrees associated with different classes of random trees: - random trees b
 uilt by preferential attachment: in this case\, the scaling limit is the B
 rownian rabbit (joint work with N. Curien\, T. Duquesne and I. Manolescu)\
 ; - critical Galton-Watson trees with finite variance: in this case the sc
 aling limit is a multiple of the CRT (joint work with N. Curien and B. Haa
 s) - critical Galton-Watson trees with infinite variance and heavy tail of
 fspring distribution: in this case\, the scaling limits are the so-called 
 stable looptrees\, which are informally the dual graphs of stable Lvy tree
 s. We will see that the scaling limit of the boundary of large critical si
 te percolation clusters on the UIPT is the random stable looptree of index
  3/2 (joint works with N. Curien).\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR