2 papers
cs.DS2026
Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers
Chenglin Fan, Jingcheng Liu, Pan Peng +2
We study the problem of releasing a synthetic graph that approximates the sizes of all cuts of an input graph under edge-level differential privacy. If one insists on purely additi…
cs.DS2025
Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
Pan Peng, Hangyu Xu
We study the problem of releasing a differentially private (DP) synthetic graph that well approximates the triangle-motif sizes of all cuts of any given graph , where a mot…