How much structure do we see in noise (a topological perspective)?

author: Primož Škraba, Artificial Intelligence Laboratory, Jožef Stefan Institute
published: March 10, 2016,   recorded: March 2016,   views: 4125


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Exploratory data analysis is the search for patterns in sampled data. In this talk, I will concentrate on geometric data, where structure often takes the form of certain shapes representing constraints in the system generating the data. For example, a sphere for normalized data or a closed curve representing a periodic system. Recent topological techniques can help us find this type of structure.

A natural question then is: what is a reasonable null hypothesis for this type of structure? In this talk, I will describe recent results characterizing how much structure we expect to find if we sample noise, which we take here to be a Poisson point process, also known as a completely spatially random model. No previous knowledge of point processes or topology will be assumed. I will overview classical results from random geometric graphs and present our results for higher dimensional analogues.

See Also:

Download slides icon Download slides: solomon_skraba_structure_in_noise_01.pdf (8.6 MB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: