BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:1450@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20161128T140000
DTEND;TZID=Europe/Paris:20161128T150000
DTSTAMP:20161113T130000Z
URL:https://www.i2m.univ-amu.fr/evenements/inference-for-conditioned-galto
 n-watson-trees-from-their-harris-path/
SUMMARY: (...): Inference for conditioned Galton-Watson trees from their Ha
 rris path
DESCRIPTION:: Tree-structured data naturally appear in various fields\, par
 ticularly in biology where plants and blood vessels may be described by tr
 ees\, but also in computer science because XML documents form a tree struc
 ture. This paper is devoted to the estimation of the relative scale of ord
 ered trees that share the same layout. The theoretical study is achieved f
 or the stochastic model of conditioned Galton-Watson trees. New estimators
  are introduced and their consistency is stated. A comparison is made with
  an existing approach of the literature. A simulation study shows the good
  behavior of our procedure on finite-sample sizes. An application to the a
 nalysis of revisions of Wikipedia articles is also considered through real
  data. -Page de Romain Azaïs |  preprint  
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR