Skip to main content Skip to navigation

Colloquium seminars

2020/2021(Terms 1 and 3): The colloquia seminar will happen on Microsoft Teams.

Current Organisers: Tom Berrett, Gechun Liang, Massimiliano Tamborrino

  • If you have ideas for possible speakers, then please email one of the organisers above.

2020/21 Term 3:

Prof. Eva Löcherbach

3pm-4pm on Wednesday 9 June

Title: TBA

Abstract: TBA

Prof. Erhan Bayakatar

3pm-4pm on Wednesday 28 April

Title: Graphon mean field systems: large population and long time limits

Abstract: We consider heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with random weights characterized by an underlying graphon. The limit is given by a graphon particle system consisting of independent but heterogeneous nonlinear diffusions whose probability distributions are fully coupled. A law of large numbers result is established as the system size increases and the underlying graphons converge. Under suitable additional assumptions, we show the exponential ergodicity for the system, establish the uniform in time law of large numbers, and introduce the uniform in time Euler approximation. The precise rate of convergence of the Euler approximation is provided. Based on joint works with Suman Chakraborty and Ruoyu Wu.

2020/21 Term 1:

Prof. Carey Priebe

3pm-4pm on Wednesday 9th December

Title: On Spectral Graph Clustering

Abstract: I will present our 2019 "Two Truths" PNAS paper. Clustering is a many-splendored thing. As the ill-defined cousin of classification, in which the observation to be classified X comes with a true but unobserved class label Y, clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering – clustering the vertices of a graph based on their spectral embedding – is all the rage, and recent theoretical results provide new understanding of the problem and solutions. In particular, we reset the field of spectral graph clustering, demonstrating that spectral graph clustering should not be thought of as kmeans clustering composed with Laplacian spectral embedding, but rather Gaussian mixture model (GMM) clustering composed with either Laplacian or Adjacency spectral embedding (LSE or ASE); in the context of the stochastic blockmodel (SBM), we use eigenvector CLTs & Chernoff analysis to show that (1) GMM dominates kmeans and (2) either LSE nor ASE dominates, and we present an LSE vs ASE characterization in terms of affinity vs core-periphery SBMs. Along the way, we describe our recent asymptotic efficiency results, as well as an interesting twist on the eigenvector CLT when the block connectivity probability matrix is not positive semidefinite. (And, time permitting, we will touch on essential results using the matrix two-to-infinity norm.) We conclude with a ‘Two Truths’ LSE vs ASE spectral graph clustering result – necessarily including model selection for both embedding dimension & number of clusters – convincingly illustrated via an exciting new diffusion MRI connectome data set: different embedding methods yield different clustering results, with one (ASE) capturing gray matter/white matter separation and the other (LSE) capturing left hemisphere/right hemisphere characterization.