42 citations · 161 across the 18 of their papers we have counts for
10 papers · 1 filter
Gaussian Database Alignment and Gaussian Planted Matching
Osman Emre Dai, Daniel Cullina, Negar Kiyavash
Database alignment is a variant of the graph alignment problem: Given a pair of anonymized databases containing separate yet correlated features for a set of users, the problem is…
Partial Recovery of Erdős-Rényi Graph Alignment via -Core Alignment
Daniel Cullina, Negar Kiyavash, Prateek Mittal +1
We determine information theoretic conditions under which it is possible to partially recover the alignment used to generate a pair of sparse, correlated Erdős-Rényi graphs. To pro…
Fundamental Limits of Database Alignment
Daniel Cullina, Prateek Mittal, Negar Kiyavash
We consider the problem of aligning a pair of databases with correlated entries. We introduce a new measure of correlation in a joint distribution that we call cycle mutual informa…
Exact alignment recovery for correlated Erdős-Rényi graphs
Daniel Cullina, Negar Kiyavash
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs on the same vertex set. The correspondence between the vert…
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…
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…