Seminar: January 17
Shmuel Weinberger, University of Chicago, Department of Mathematics
Persistent homology of large networks
This talk will be about some "large scale" homology
theories that can be used to understand (or manipulate) geometric
information present at large scale in graphs. I will illustrate the
ideas by pointing out connections to flows and random walks, and also
some applications in pure math, to uniform embeddings, and to
distinguishing network growth models (e.g. for the internet) from one
another.