The Taub Faculty of Computer Science Events and Talks

I will speak about an unexpected correspondence between a beautiful theory, due to Lovasz, about homomorphisms and graph limits and a popular heuristic for the graph isomorphism problem known as the Weisfeiler-Leman algorithm. I will also relate this to graph kernels in machine learning. Indeed, the context of this work is to design and understand similarity measures between graphs and discrete structures.

(Joint work with Jan Böker, Holger Dell, and Gaurav Rattan.)