arXiv (All)
open access
Subgraph Counting with Local Node Differential Privacy
We study the problem of approximately counting subgraphs under local node differential privacy (LNDP), a recently introduced model that enforces strong privacy guarantees in analyses of distributed social networks. We design a noninteractive $(\varepsilon,0)$-LNDP algorithm that, given any public $k
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Subgraph Counting with Local Node Differential Privacy#1348761
- Local Node Differential Privacy#1186420
- Towards Personalized Differentially Private Learning for Decentralized Local Graphs#343375
- Node Differentially Private Algorithms for Survivable Networks and Graphs Analysis#220271
- Pseudo-likelihood-based $M$-estimation of random graphs with dependent edges and parameter vectors of increasing dimension#1034618
Record · ID 1357933
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive