Co-occurring keywords · papers mentioning both
Papers
Counting Graphlets of Size k under Local Differential Privacy
AISTATS 2025
Homomorphism Expressivity of Spectral Invariant Graph Neural Networks
ICLR 2025
Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
ICLR 2024
Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation Extended Abstract
COLT 2024
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters
ICLR 2024
Publishing Number of Walks and Katz Centrality under Local Differential Privacy
UAI 2024
Faster approximate subgraph counts with privacy
NeurIPS 2023
A Theoretical Comparison of Graph Neural Network Extensions
ICML 2022
Can Graph Neural Networks Count Substructures?
NeurIPS 2020
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
NeurIPS 2019
Principal Component Analysis and Higher Correlations for Distributed Data
COLT 2014