BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv5.1.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20180828T110000
DTEND;TZID=UTC:20180828T120000
DTSTAMP:20200803T234625
CREATED:20180816T114913Z
LAST-MODIFIED:20190925T094728Z
UID:2168-1535454000-1535457600@www.eurandom.tue.nl
SUMMARY:Eindhoven Stochastics Seminar
DESCRIPTION:Nicolas Broutin (Sorbonne UniversitĂ©) \nFragmentations and tree-like fractals: a functional fixed-point approach\nI will review some models and recent results where ``fixed-points'' approach or the ``contraction method'' have played a central role. Recursive partitioning schemes are central to many applications\, starting with efficient data structures based on the divide-and-conquer paradygm. For more than 25 years now\, arguments based on Banach fixed theorem have long been used to prove ``softly'' the convergence in distribution of associated real-valued random variables in the context of analysis of algorithms. I will review a number of questions that call for a more general approach for random functions. The applications include the quantification of the cost of partial match search queries in data data such as quad trees and k-trees\, the construction of natural fractal tree-like objects such as Aldous' continuum random trees\, or certain trees that are dual to recursive geometric partitions\, and extend to the convergence of certain random fields. \nThis is based on a collection of joint works with Henning Sulzbach and Ralph Neininger. \nÂ \n
URL:https://www.eurandom.tue.nl/event/einidhoven-stochastics-seminar/
LOCATION:MF 14 (6th floor\, MetaForum Building\, TU/e)
CATEGORIES:STO Seminar
END:VEVENT
END:VCALENDAR