Online Program Home
My Program

Abstract Details

Activity Number: 13
Type: Invited
Date/Time: Sunday, July 31, 2016 : 2:00 PM to 3:50 PM
Sponsor: Section on Nonparametric Statistics
Abstract #318603
Title: Co-Clustering of Nonsmooth Graphons
Author(s): David Sungjun Choi*
Companies: Carnegie Mellon University
Keywords: network data ; stochastic blockmodel ; community detection ; co-clustering ; graphon ; statistical learning theory

Theoretical results are becomming known for community detection and clustering of networks; however, these results assume an idealized generative model that is unlikely to hold in many settings. Here we consider exploratory co-clustering of a bipartite graph, where the rows and columns of the adjacency matrix are assumed to be samples from an arbitrary population. This is equivalent to assuming that the data is generated from a nonparametric model known as a graphon. We show that co-clusters found by any method can be extended to the row and column populations, or equivalently that the estimated blockmodel approximates a blocked version of the generative graphon, with generalization error bounded by n^{-1/2}. Analogous results are also shown for degree-corrected co-blockmodels and random dot product bipartite graphs, with error rates depending on the dimensionality of the latent variable space.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

Copyright © American Statistical Association