Video Lectures

Separate tags with a comma.

Random sampling a subgraph of a graph is an important algorithmic technique.  Solving some problems on the (smaller) subgraph is naturally faster, and can give either a useful approximate answer, or sometimes even give a result that can be quickly...

 

In this talk, I will give an overview of some recent results motivated by the computation and applications of persistent homology, a theory that creates a bridge between the continuous world of topology and the discrete world of data, and assigns...