This talk focuses on the problem of finding the underlying communitieswithin a network using only knowledge of network topology. We consider agenerative model for a network, namely the planted cluster model, which is asimple extension of the classical stochastic block model. We derive a semidefinite programming (SDP) relaxation of the maximum li...
Wu, Yihong (University of Illinois at Urbana-Champaign)
University of Minnesota, Institute for Mathematics and its Applications.