BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Maximal persistence
DTSTART:20160222T141500
DTEND:20160222T153000
DTSTAMP:20260407T041357Z
UID:3e96a49875db1fb3019a3be0fe6d4dd17fc9727fce466348fb5393e8
CATEGORIES:Conferences - Seminars
DESCRIPTION:Primoz Skraba (Jozef Stefan Institute)\n\n	 \n\n	 \nPersiste
 nt homology is a central tool in topological data analysis. It describes v
 arious structures such as components\, holes\, voids\, etc. via a barcode 
 (or a persistence diagram)\, with longer bars representing "real" structur
 e and shorter bars representing "noise." A natural question is how long ar
 e the bars we can expect to see from data with no structure\, i.e. noise. 
 In this talk\, I will introduce some recent results regarding the persiste
 nt homology of random processes\, specifically\, a homogeneous Poisson pro
 cess. In particular\, I will describe how we obtain upper and lower bounds
  on what is the longest bar we expect to see if our input is "noise."\n\n	
  \n\n	 
LOCATION:CM 113
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR