- Stochastics Seminar
- Thursday, January 21, 2021 - 15:30 for 1 hour (actually 50 minutes)
- https://bluejeans.com/751242993/PASSWORD (To receive the password, please email Lutz Warnke)
- Sayan Mukherjee – Duke University
Frieze showed that the expected weight of the minimum spanning tree (MST) of the uniformly weighted graph converges to ζ(3). Recently, this result was extended to a uniformly weighted simplicial complex, where the role of the MST is played by its higher-dimensional analogue -- the Minimum Spanning Acycle (MSA). In this work, we go beyond and look at the histogram of the weights in this random MSA -- both in the bulk and in the extremes. In particular, we focus on the `incomplete' setting, where one has access only to a fraction of the potential face weights. Our first result is that the empirical distribution of the MSA weights asymptotically converges to a measure based on the shadow -- the complement of graph components in higher dimensions. As far as we know, this result is the first to explore the connection between the MSA weights and the shadow. Our second result is that the extremal weights converge to an inhomogeneous Poisson point process. A interesting consequence of our two results is that we can also state the distribution of the death times in the persistence diagram corresponding to the above weighted complex, a result of interest in applied topology.
Based on joint work with Nicolas Fraiman and Gugan Thoppe, see https://arxiv.org/abs/2012.14122