Looptrees

1 hour 3 mins,  918.78 MB,  MPEG-4 Video  640x360,  29.97 fps,  44100 Hz,  1.94 Mbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Kortchemski, I (CNRS (Centre national de la recherche scientifique))
Tuesday 21 April 2015, 15:30-16:30
 
Created: 2015-04-22 17:21
Collection: Random Geometry
Publisher: Isaac Newton Institute
Copyright: Kortchemski, I
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: 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 interested in the scaling limits, for the Gromov-Hausdorff topology, of looptrees associated with different classes of random trees: - random trees built by preferential attachment: in this case, the scaling limit is the Brownian rabbit (joint work with N. Curien, T. Duquesne and I. Manolescu); - critical Galton-Watson trees with finite variance: in this case the scaling limit is a multiple of the CRT (joint work with N. Curien and B. Haas) - critical Galton-Watson trees with infinite variance and heavy tail offspring distribution: in this case, the scaling limits are the so-called stable looptrees, which are informally the dual graphs of stable Lévy trees. We will see that the scaling limit of the boundary of large critical site percolation clusters on the UIPT is the random stable looptree of index 3/2 (joint works with N. Curien).
Available Formats
Format Quality Bitrate Size
MPEG-4 Video * 640x360    1.94 Mbits/sec 918.78 MB View Download
WebM 640x360    438.52 kbits/sec 202.35 MB View Download
iPod Video 480x270    522.94 kbits/sec 241.30 MB View Download
MP3 44100 Hz 250.36 kbits/sec 115.53 MB Listen Download
Auto (Allows browser to choose a format it supports)