H.B. Keller Colloquium
Graphical designs are quadrature rules on graphs that are discrete
analogs of spherical designs on the sphere. They have a number of
applications to areas such as graph sampling and random walks. An
important question about designs is how to compute/optimize
over them. I will explain how positively weighted designs can be
organized on the faces of a polytope, and how this connection can be
used to compute and optimize designs in several families of graphs.
The polytope connection also yields complexity results.