BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Gábor Tardos (Budapest)
DTSTART:20201023T130000Z
DTEND:20201023T140000Z
DTSTAMP:20260423T003254Z
UID:WCS/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/7/">Conv
 ergence and limits of finite trees</a>\nby Gábor Tardos (Budapest) as par
 t of Warwick Combinatorics Seminar\n\n\nAbstract\nSeeing the success of li
 mit theory of dense finite graphs with graphons as their limit objects we 
 developed a similar (?) theory for finite trees. In order for the sampling
  limit to make sense we need to make the trees "dense" - we do this by con
 sidering them as metric spaces with the normalized graph distance. Using u
 ltaproducts is a simple and elegant way to find unique limit objects (we c
 all them dendrons) and also to highlight similarities and major difference
 s from the theory of dense graph limits. For the underlying quantitative a
 pproximation results\, one needs more "down to earth" techniques to be dev
 eloped.\nThis is joint work with Gábor Elek.\n
LOCATION:https://researchseminars.org/talk/WCS/7/
END:VEVENT
END:VCALENDAR