5 citations · 5 across the 1 of their papers we have counts for
3 papers
Significance of Side Information in the Graph Matching Problem
Kushagra Singhal, Daniel Cullina, Negar Kiyavash
Percolation based graph matching algorithms rely on the availability of seed vertex pairs as side information to efficiently match users across networks. Although such algorithms w…
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…
Learning Network of Multivariate Hawkes Processes: A Time Series Approach
Jalal Etesami, Negar Kiyavash, Kun Zhang +1
Learning the influence structure of multiple time series data is of great interest to many disciplines. This paper studies the problem of recovering the causal structure in network…