BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251124T164032EST-40371u8t7P@132.216.98.100
DTSTAMP:20251124T214032Z
DESCRIPTION:Title: Network archeology: on revealing the past of random tree
 s.\n\nAbstract: Networks are often naturally modeled by random processes i
 n which nodes of the network are added one-by-one\, according to some rand
 om rule. Uniform and preferential attachment trees are among the simplest 
 examples of such dynamically growing networks. The statistical problems we
  address in this talk regard discovering the past of the network when a pr
 esent-day snapshot is observed. Such problems are sometimes termed 'networ
 k archeology'. We present a few results that show that\, even in gigantic 
 networks\, a lot of information is preserved from the very early days\n
DTSTART:20191017T193000Z
DTEND:20191017T203000Z
LOCATION:Room PK-5115 \, CA\, Pavillon President-Kennedy
SUMMARY:Gabor Lugosi\, Pompeu Fabra University\, Spain
URL:/mathstat/channels/event/gabor-lugosi-pompeu-fabra
 -university-spain-301758
END:VEVENT
END:VCALENDAR