2 citations · 3 across the 12 of their papers we have counts for
12 papers
Can Graph Learning Learn Circuits?
Chester Tan, Moritz Lampert, Courtney Maynard +3
Circuit localization is a mechanistic interpretability task whose goal is to identify a sparse subgraph of a transformer's computation graph sufficient to reproduce a particular be…
Single-Snapshot Inference of Network Couplings from Universal Dynamics at Relative Equilibrium
Moritz Lampert, Dominic Grün, Ingo Scholtes
Many real-world systems can be modelled as complex networks whose collective behaviour is governed by hidden interactions between nodes. Existing methods for inferring these intera…
The Role of Node Features in Graph Pooling
Jan von Pichowski, Alžbeta Hrabošová, Ingo Scholtes +1
Graph pooling is commonly applied in graph classification, yet its empirical gains over standard WL-1 expressive GNNs are often marginal or inconsistent. We study this gap by analy…
Bursts and Triggers: Socially-Driven Activity in Open-Source Co-Editing Networks
Lisi Qarkaxhija, Maximilian Capraro, Stefan Menzel +2
The long-term sustainability of Open Source Software (OSS) communities depends on the activity of their developers, yet the social mechanisms driving this collective behavior remai…
Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs
Franziska Heeg, Jonas Sauer, Petra Mutzel +1
An important characteristic of temporal graphs is how the directed arrow of time influences their causal topology, i.e., which nodes can possibly influence each other causally via…
Deep Graph Learning will stall without Network Science
Christopher Blöcker, Martin Rosvall, Ingo Scholtes +1
Deep graph learning focuses on flexible and generalizable models that learn patterns in an automated fashion. Network science focuses on models and measures revealing the organizat…
Generating Temporal Contact Graphs Using Random Walkers
Anton-David Almasan, Sergey Shvydun, Ingo Scholtes +1
We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequen…
MDL-Pool: Adaptive Multilevel Graph Pooling Based on Minimum Description Length
Jan von Pichowski, Christopher Blöcker, Ingo Scholtes
Graph pooling compresses graphs and summarises their topological properties and features in a vectorial representation. It is an essential part of deep graph representation learnin…
From Link Prediction to Forecasting: Addressing Challenges in Batch-based Temporal Graph Learning
Moritz Lampert, Christopher Blöcker, Ingo Scholtes
Dynamic link prediction is an important problem considered in many recent works that propose approaches for learning temporal edge patterns. To assess their efficacy, models are ev…
Flow Divergence: Comparing Maps of Flows with Relative Entropy
Christopher Blöcker, Ingo Scholtes
Networks represent how the entities of a system are connected and can be partitioned differently, prompting ways to compare partitions. Common approaches for comparing network part…
The Self-Loop Paradox: Investigating the Impact of Self-Loops on Graph Neural Networks
Moritz Lampert, Ingo Scholtes
Many Graph Neural Networks (GNNs) add self-loops to a graph to include feature information about a node itself at each layer. However, if the GNN consists of more than one layer, t…
Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs
Franziska Heeg, Ingo Scholtes
Node centralities play a pivotal role in network science, social network analysis, and recommender systems. In temporal data, static path-based centralities like closeness or betwe…