BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Département de mathématiques et applications - ECPv6.2.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Département de mathématiques et applications
X-ORIGINAL-URL:https://www.math.ens.psl.eu
X-WR-CALDESC:évènements pour Département de mathématiques et applications
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20260427T140000
DTEND;TZID=Europe/Paris:20260427T150000
DTSTAMP:20260420T140044
CREATED:20260420T100943Z
LAST-MODIFIED:20260420T100944Z
UID:21334-1777298400-1777302000@www.math.ens.psl.eu
SUMMARY:Robin Khanfir - The Brownian tree is the only uniformly self-similar binary tree
DESCRIPTION:The Brownian tree is the scaling limit of many random tree models for which the square of the diameter is of the order of the number of vertices. In contrast to this universality\, proofs of such convergences commonly rely on model-specific methods. To provide a conceptual understanding of the universality of the Brownian tree\, we show that it is uniquely characterized by a uniform self-similar decomposition property. This leads to a general proof scheme for convergences to the Brownian tree that does not require the computation of finite-dimensional limit distributions. This talk is based on a work in progress.
URL:https://www.math.ens.psl.eu/evenement/robin-khanfir-the-brownian-tree-is-the-only-uniformly-self-similar-binary-tree/
LOCATION:Salle W (ENS)
CATEGORIES:Séminaire informel de probabilités
END:VEVENT
END:VCALENDAR