arXiv

NetPTR: Optimal Differentially Private Spectral Community Detection on Sparse Networks (opens in new tab)

Spectral community detection estimates latent labels from the leading eigenspace of a network adjacency matrix, but releasing the resulting labels can disclose sensitive relational information. We consider this problem under differential privacy for both ordinary and bipartite networks. For ordinary networks, the protected unit is a single edge, leading to edge differential privacy (edge-DP). For bipartite networks, the inferential target is the...

Read the original article
Sign in to keep reading the full article.

Keyboard Shortcuts

Navigation

Next / previous post
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Discover
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help