Maximal persistence
Event details
| Date | 22.02.2016 |
| Hour | 14:15 › 15:30 |
| Speaker | Primoz Skraba (Jozef Stefan Institute) |
| Location |
CM 113
|
| Category | Conferences - Seminars |
Persistent homology is a central tool in topological data analysis. It describes various structures such as components, holes, voids, etc. via a barcode (or a persistence diagram), with longer bars representing "real" structure and shorter bars representing "noise." A natural question is how long are 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 persistent homology of random processes, specifically, a homogeneous Poisson process. 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."
Practical information
- Informed public
- Free
Organizer
- Kathryn Hess