Topological polymer models
Monday, June 24, 2019 - 10:15am - 11:15am
In this talk, we discuss the simplest model of a random graph embedding: the edge vectors are multivariate Gaussians conditioned on the topological constraints implied by the graph type. We will show that this model has a surprisingly rich and appealing theory, and allows for a variety of exact calculations for particular network types. This talk is joint work with Tetsuo Deguchi, Clayton Shonkwiler, and Erica Uehara.