This page gives a brief overview of the datasets used to evaluate differentially private algorithms' performance, with respect to releasing a graph's degree distribution and subgraph counting.
| Name | # of Vertices | # of Edges | Maximum Degree | Clustering Cofficient c | Description |
|---|---|---|---|---|---|
| 4,039 | 88,234 | 1,045 | 0.6055 | Social circles from Facebook (anonymized) | |
| WIKI | 7,115 | 103,689 | 1,065 | 0.1409 | Wikipedia who-votes-on-whom network |
| CIT | 27,770 | 352,807 | 2,468 | 0.3120 | Arxiv High Energy Physics paper citation network |
| 36,692 | 183,831 | 1,383 | 0.4970 | Email communication network from Enron | |
| DBLP | 317,080 | 1,049,866 | 343 | 0.6324 | DBLP collaboration network |