[YPNG] YPNG 19 Feb 2016

[Sekhar Tatikonda]

Hi Folks,

In the YPNG seminar this week Anderson will speak on:

Title: Polynomial-time and Rate-optimal Algorithm for Community
Detection in Stochastic Block Model

Description: We proposed a novel algorithm for community detection in
Stochastic Block Model (SBM). Networks are often observed to have
community (i.e., cluster) structure, where nodes from the same
community are more closely connected. The community detection is a
clustering problem on nodes, given the information on mutual
connectivity. Our algorithm is polynomial-time and rate-optimal. It is
a two-stage algorithm: use Spectral Clustering as initializer and then
refine the estimation of label node by node. In this talk we will
explain in detail how our algorithm works and we will also discuss the
theoretical results in our paper.

This is a joint work with C. Gao, Z. Ma and H. Zhou (Arxiv: 1505.03772).

See you Friday in the Stat's classroom at 11am.

Regards,
sekhar