University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Convex Relaxation for Community Detection with Covariates

Convex Relaxation for Community Detection with Covariates

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

SNAW01 - Graph limits and statistics

Community detection in networks is an important problem in many applied areas. We investigate this in the presence of node covariates. Recently, an emerging body of theoretical work has been focused on  leveraging information from both the edges in the network and the node covariates to infer community memberships. However, in most parameter regimes, one of the sources of information provides enough information to infer the hidden clusters, thereby making the other source redundant. We show that when the network and the covariates carry ``orthogonal'' pieces of information about the cluster memberships, one can get asymptotically consistent clustering by using them both, while each of them fails individually. 

This is joint work with Bowei Yan, University of Texas at Austin.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity