2 papers
cs.DM2025
On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
Alexander Pluska, Sagar Malhotra
Local convergence has emerged as a fundamental tool for analyzing sparse random graph models. We introduce a new notion of local convergence, color convergence, based on the Weisfe…
cs.LG2024
Logical Distillation of Graph Neural Networks
Alexander Pluska, Pascal Welke, Thomas Gärtner +1
We present a logic based interpretable model for learning on graphs and an algorithm to distill this model from a Graph Neural Network (GNN). Recent results have shown connections…