h1

h2

h3

h4

h5
h6

SymSim

Symmetry and Similarity

Grant period2022-10-01 - 2027-09-30
Funding bodyEuropean Union
Call numberERC-2021-ADG
Grant number101054974
IdentifierG:(EU-Grant)101054974

Note: The goal of this project is to develop an algorithmic theory of similarity between graphs. Graphs are versatile models for representing complex data ranging from chemical molecules to social interactions. Dealing with graphical data and enabling modern data analysis techniques, a fundamental task is to compare graphs and to measure their similarity, preferably in a semantically meaningful and algorithmically efficient way. However, it is not clear at all how to achieve this. In many application areas, for example, computer vision, database systems, and formal verification, researchers have proposed (often ad-hoc) solutions to this problem tailored for the specific application, but a general theory is missing. We will develop such a theory in this project. Similarity of graphs has many different facets. We will identify the common core of different approaches to similarity, but also exhibit their differences. We will design methods for comparing different similarity measures and for obtaining a semantic understanding of similarity. We will develop criteria for the suitability of various similarity measures for different types of applications. A particular focus of our research will be on efficient algorithms for computing similarity. There is little use in having a perfect similarity measure if we have no efficient way of determining how similar two graphs are. A classic algorithmic problem in this context is the graph isomorphism problem of deciding whether two graphs are structurally identical. Determining the precise computational complexity of this problem, or of the equivalent problem of computing all symmetries of a graph, is regarded to be one of the most important open questions in theoretical computer science. Building on recent progress, we will design new algorithms breaking barriers towards a polynomial-time algorithm for the isomorphism problem.
   

Recent Publications

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Dissertation / PhD Thesis  ;  ;
On the uniform expressivity of graph neural networks
Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen () [10.18154/RWTH-2025-11092] = Dissertation, RWTH Aachen University, 2025  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
50th International Symposium on Mathematical Foundations of Computer Science : MFCS 2025, August 25-29, 2025, Warsaw, Poland / edited by Paweł Gawrychowski, Filip Mazowiecki, Michał Skrzypczaks
50. International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, WarsawWarsaw, Poland, 25 Aug 2025 - 29 Aug 20252025-08-252025-08-29 Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 345, [18:1]-18:19 () [10.4230/LIPIcs.MFCS.2025.18]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article/Contribution to a book  ;  ;  ;  ;
Exploring data augmentation: Multi-task methods for molecular property prediction
Computers & chemical engineering 201, 109253 () [10.1016/j.compchemeng.2025.109253] special issue: "Machine learning in chemical engineering : Special issue / Guest Editors: Professor Alexander Mitsos, Dr. Erik Esche, Professor Artur M. Schweidtmann"  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;
The Iteration Number of the Weisfeiler-Leman Algorithm
ACM transactions on computational logic : TOCL 26(1), 6 () [10.1145/3708891]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;
Computational Complexity of the Weisfeiler-Leman Dimension
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33. EACSL Annual Conference on Computer Science Logic, CSL 2025, AmsterdamAmsterdam, Netherlands, 10 Feb 2025 - 14 Feb 20252025-02-102025-02-14 Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 () [10.4230/LIPIcs.CSL.2025.13]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Dissertation / PhD Thesis  ;  ;
Homomorphism indistinguishability
Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen () [10.18154/RWTH-2024-11629] = Dissertation, RWTH Aachen University, 2024  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Dissertation / PhD Thesis  ;  ;
Structural similarity of graphs: graphons and homomorphism densities
Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen () [10.18154/RWTH-2024-09270] = Dissertation, RWTH Aachen University, 2024  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article/Contribution to a conference proceedings
Logical equivalences, homomorphism indistinguishability, and forbidden minors
48. International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, BordeauxBordeaux, France, 28 Aug 2023 - 1 Sep 20232023-08-282023-09-01 Information and computation 301(Part A), 105224 () [10.1016/j.ic.2024.105224] special issue: "Special issue on the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Guest Editors: Dr. Jérôme Leroux, Professor David Peleg"  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
TheoretiCS : an open access journal in theoretical computer science 3, 12321 () [10.46298/theoretics.24.20]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, BratislavaBratislava, Slovakia, 26 Aug 2024 - 30 Aug 20242024-08-262024-08-30 Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 () [10.4230/LIPIcs.MFCS.2024.82]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 

 Record created 2023-02-24, last modified 2023-02-25
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)