[DMO] Blaine Keetch: Graph diffusion applied to isomorphic and non-isomorphic graphs

21 juni 2024 11:00 t/m 12:00 - Locatie: Lecture Hall Chip, 36.HB.01.600 | Zet in mijn agenda

"Given two graphs G1 and G2, a graph isomorphism is a bijection which maps the nodes of G1 to the nodes of G2, such that the edges of the graphs are preserved in the bijection. Two graphs are said to be isomorphic if there exists an isomorphism of their nodes.
In this talk, I will present some preliminary results showing that two graphs are isomorphic, if and only if, their graph diffusion operators are isomorphic, and show how, subject to an appropriate choice of initial condition, graph diffusion can be applied to test for graph isomorphism. I will also present some preliminary context on algorithm complexity classes, the graph isomorphism problem, spectral graph theory, and graph diffusion."