Prof. Martin Grohe is full professor at
RWTH Aachen University where he heads the chair for Logic and
Theory of Discrete Systems. His research interests are logic, algorithms
und complexity, database theory, graph theory, and algorithmic learning
theory.(Joint work with Holger Dell and Gaurav Rattan.)
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 desgin and
understand similarity measures between graphs and discrete structures.