We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We describe a novel protocol for computing the egocentric betweenness centrality of a node when relevant edge information is spread between two mutually distrusting parties such as two telecommunications providers. While each node belongs to one network or the other, its ego network might include edges unknown to its network provider. We develop a protocol of differentially-private mechanisms to hide each network's internal edge structure from the other; and contribute a new two-stage stratified sampler for exponential improvement to time and space efficiency. Empirical results on several open graph data sets demonstrate practical relative error rates while delivering strong privacy guarantees, such as 16% error on a Facebook data set.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1901.05562")
get_code_for_paper("1901.05562")
have("1901.05562")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1901.05562.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1901.05562)
Connect an agent — have() is free.