Discrete Math Seminar: Lele Wang

Inspired by a problem in joint source-channel coding, we introduce a new notion of similarity between graphs, termed graph information ratio. We discuss various properties of this measure, including in particular metric structure and partial ordering of graphs, an information ratio power inequality, relations to graph homomorphism, algebraic identities and inequalities, and more.