PriME: Privacy-aware Membership profile Estimation in networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915635442745344 |
|---|---|
| author | Chakraborty, Abhinav Chatterjee, Sayak Nandy, Sagnik |
| author_facet | Chakraborty, Abhinav Chatterjee, Sayak Nandy, Sagnik |
| contents | This paper presents a novel approach to estimating community membership probabilities for network vertices generated by the Degree Corrected Mixed Membership Stochastic Block Model while preserving individual edge privacy. Operating within the $\varepsilon$-edge local differential privacy framework, we introduce an optimal private algorithm based on a symmetric edge flip mechanism and spectral clustering for accurate estimation of vertex community memberships. We conduct a comprehensive analysis of the estimation risk and establish the optimality of our procedure by providing matching lower bounds to the minimax risk under privacy constraints. To validate our approach, we demonstrate its performance through numerical simulations and its practical application to real-world data. This work represents a significant step forward in balancing accurate community membership estimation with stringent privacy preservation in network data analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02794 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | PriME: Privacy-aware Membership profile Estimation in networks Chakraborty, Abhinav Chatterjee, Sayak Nandy, Sagnik Methodology Social and Information Networks Statistics Theory This paper presents a novel approach to estimating community membership probabilities for network vertices generated by the Degree Corrected Mixed Membership Stochastic Block Model while preserving individual edge privacy. Operating within the $\varepsilon$-edge local differential privacy framework, we introduce an optimal private algorithm based on a symmetric edge flip mechanism and spectral clustering for accurate estimation of vertex community memberships. We conduct a comprehensive analysis of the estimation risk and establish the optimality of our procedure by providing matching lower bounds to the minimax risk under privacy constraints. To validate our approach, we demonstrate its performance through numerical simulations and its practical application to real-world data. This work represents a significant step forward in balancing accurate community membership estimation with stringent privacy preservation in network data analysis. |
| title | PriME: Privacy-aware Membership profile Estimation in networks |
| topic | Methodology Social and Information Networks Statistics Theory |
| url | https://arxiv.org/abs/2406.02794 |