University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Co-clustering of non-smooth graphons

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Co-clustering of non-smooth graphons

Download to your calendar using vCal

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

SNAW01 - Graph limits and statistics

Theoretical results are becoming 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 network, 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.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room W4.05 Cambridge Judge Business School Centre of Development Studies' Meeting Room Marshall Lectures

Other talks

Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? CSaP Annual Cleevely Lecture 2026 Feedback and the circumgalactic medium TBC Morning Break Title tbc
 

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