SDP for Community Detection with many communities

I am happy to announce that there is significant progress on Open Problem 9.2. of my notes, in this paper Bruce Hajek, Yihong Wu, and Jiaming Xu show that, indeed, for k = \Omega(\log n) communities, the natural Semidefinite Program is suboptimal!

Congratulations to the three!

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s