Kavli Affiliate: Xian Chen| Summary: Subgraph counting is a fundamental problem in graph analysis. Motivated by practical scenarios where graph analytics are performed on subgraphs induced by selected vertices — rather than on the entire graph — and by growing privacy concerns, we initiate the study of differentially private range subgraph counting (DPRSC). The goal […]
Continue.. Differentially Private Range Subgraph Counting