1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
Edge-Girth as a Structural Edge Feature for Graph Neural Networks
Lilian Marey, Charlotte Laclau
Graph neural networks (GNN) based on message passing are provably no more powerful than the one-dimensional Weisfeiler--Leman colour-refinement test (1-WL): two graphs it cannot te…
On the Realizability of Edge-Girth Sequences
Lilian Marey, Paul Hilaire, Charlotte Laclau
The edge-girth of an edge in a simple connected graph is the length of a shortest cycle containing , with if no such cycle exists, and the edge-girth sequence…
k-hop Fairness: Addressing Disparities in Graph Link Prediction Beyond First-Order Neighborhoods
Lilian Marey, Tiphaine Viard, Charlotte Laclau
Link prediction (LP) plays a central role in graph-based applications, particularly in social recommendation. However, real-world graphs often reflect structural biases, most notab…
Structural Bias Beyond Homophily: A Study of Fairness in Link Prediction
Lilian Marey, Mathilde Perez, Tiphaine Viard +1
Graph link prediction (LP) plays a critical role in socially impactful applications such as job recommendation and friendship formation, making fairness a critical concern in this…