3 papers
cs.DS2026
Differentially Private Range Subgraph Counting
Xian Chen, Ruobing Bai, Pan Peng
Subgraph counting is a fundamental problem in graph analysis. Motivated by practical scenarios where graph analytics are performed on subgraphs induced by selected vertices -- rath…
cs.DS2024
A Differentially Private Clustering Algorithm for Well-Clustered Graphs
Weiqiang He, Hendrik Fichtenberger, Pan Peng
We study differentially private (DP) algorithms for recovering clusters in well-clustered graphs, which are graphs whose vertex set can be partitioned into a small number of sets,…
cs.DS2023
A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
Ranran Shen, Pan Peng
We address the problem of designing a sublinear-time spectral clustering oracle for graphs that exhibit strong clusterability. Such graphs contain latent clusters, each charact…