Skip to main content
Browse by:

Until further notice, in-person public events have been canceled. Event listings include how to access online content.
Please check before coming to campus.

Limit Theorems for Joint Embeddings of Multiple Random Networks

Probability Seminar
Icon calendar
Thursday, April 08, 2021
Icon time
3:15 pm - 4:15 pm
Icon location
Icon speaker
Avanti Athreya
Icon series
Probability Seminar

Graph embeddings, in which the vertices of a network are mapped
to vectors in a low-dimensional Euclidean space, have gained traction as a basic tool for statistical network inference. We describe a joint---or "omnibus"---embedding in which multiple graphs on the same vertex set are jointly embedded into a single space, with a distinct representation for each graph. We prove a consistency result and a central limit theorem for this omnibus procedure. Through analysis of connectome data, we show that the omnibus embedding can yield insight into network structure at different scales.

Email Jonathan Mattingly for zoom link