42 citations · 161 across the 18 of their papers we have counts for
3 papers · 1 filter
Rate-distance tradeoff for codes above graph capacity
Daniel Cullina, Marco Dalai, Yury Polyanskiy
The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at…
On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks
Daniel Cullina, Kushagra Singhal, Negar Kiyavash +1
We consider the problem of performing community detection on a network, while maintaining privacy, assuming that the adversary has access to an auxiliary correlated network. We ask…
Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching
Daniel Cullina, Negar Kiyavash
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs. For a pair of correlated graphs on the same vertex set, th…