Donlapark Ponnoprat

Counting Graphlets of Size k under Local Differential Privacy

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,…