PREVIOUS SEMINAR - 26th February 2021
Speaker: Eric Kolaczyk (Boston University)
Title: How hard is it to work with a network `average'?
Abstract: I will briefly summarize work with colleagues that places the question raised in the title into an appropriate context, with respect to the corresponding geometry and probability, in order to motivate principled notions of network averages with provably analogous behavior to that of your standard scalar and vector averages. Leveraging these results for the purposes of statistical inference in practice, however, requires addressing various computational challenges, particularly in the case of unlabeled networks.