2 papers
cs.CC2020
Is the space complexity of planted clique recovery the same as that of detection?
Jay Mardia
We study the planted clique problem in which a clique of size k is planted in an Erdős-Rényi graph G(n, 1/2), and one is interested in either detecting or recovering this planted c…
cs.IT2018
Concentration Inequalities for the Empirical Distribution
Jay Mardia, Jiantao Jiao, Ervin Tánczos +2
We study concentration inequalities for the Kullback--Leibler (KL) divergence between the empirical distribution and the true distribution. Applying a recursion technique, we impro…