Research Article
Differential Privacy for Evolving Network Based on GHRG
Algorithm 3
Generate synthetic graph.
. | Input: input graph , sampled dendrogram , privacy parameter | | Output: synthetic graph | (1) | root node of ; | (2) | PCBD ; | (3) | for each pair of vertices do | (4) | find the lowest common ancestor r of i and j in ; | (5) | place an edge in between i and j with independent probability ; | (6) | for end | (7) | return; |
|