270 citations · 835 across the 84 of their papers we have counts for
4 papers · 1 filter
On the Information Theoretic Limits of Learning Ising Models
Karthikeyan Shanmugam, Rashish Tandon, Alexandros G. Dimakis +1
We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been r…
Graph Theory versus Minimum Rank for Index Coding
Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg
We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negat…
Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes
Karthikeyan Shanmugam, Alexandros G. Dimakis
We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Re…
Sparse Polynomial Learning and Graph Sketching
Murat Kocaoglu, Karthikeyan Shanmugam, Alexandros G. Dimakis +1
Let be a polynomial with at most non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distributio…