← Search

Quentin Hillebrand

3 accepted papers

2025

Counting Graphlets of Size k under Local Differential Privacy

AISTATS 2025poster

The problem of counting subgraphs or graphlets under local differential privacy is an important challenge that has attracted significant attention from researchers. However, much of the existing work focuses on small graphlets like triangles or $k$-stars. In this paper, we propose a non-interactive,…

Cited by 2SourcecodeScholar
2024

Publishing Number of Walks and Katz Centrality under Local Differential Privacy

UAI 2024poster

In our study, we present an algorithm for publishing the count of walks and Katz centrality under local differential privacy (LDP), complemented by a comprehensive theoretical analysis. While previous research in LDP has predominantly focused on counting subgraphs with a maximum of five nodes, our w…

Cited by 3SourcePDFScholar