BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:530@lincs.fr
DTSTART;TZID=Europe/Paris:20200219T110000
DTEND;TZID=Europe/Paris:20200219T120000
DTSTAMP:20200306T092920Z
URL:https://www.lincs.fr/events/asymptotics-for-euclidean-minimal-spanning
 -trees-on-random-points/
SUMMARY:Asymptotics for Euclidean minimal spanning trees on random points
DESCRIPTION:I will present the main ideas of the paper "Asymptotics for
 Euclidean minimal spanning trees on random points" by David Aldous and J.
 Michael Steele. In this paper\, the authors define Euclidean minimal
 spanning forest on a Poisson point process using a greedy algorithm. They
 compute the expectation of functionals on this minimal spanning forest such
 as the degree of a vertex\, the sum of the d-th power of edge lengths
 incident at a vertex (where d is the dimension of the Euclidean space on
 which Poisson point lie). Their computations are based on the approximation
 of the Poisson point process with a scaled and shifted uniform i.i.d.
 random points on the unit cube. The conjectures posed by the authors in
 this paper were partially resolved later and stimulated further
 research.\n\nThe slides.
CATEGORIES:Network Theory,Working Group
LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013
 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT
 Digital):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR