Welcome to the homepage of the Networks seminars, a weekly seminar series on networks, complex systems, and related topics held in the Mathematical Institute.  In this year's series, we will alternate between regular talks and "fresh from the arXiv" talks (FFTA) in which we invite the author of a recently published (pre)print to discuss their work. Suggestions are always welcome!

The Networks seminar usually takes place on Tuesdays at 14:00-15:00. In line with current regulation, we are excited to announce that the seminars will now run with a new hybrid format that will allow attendees to choose whether to join our group in person in room C1 at the Mathematical Institute, or to attend remotely on Zoom. A link to the event will be made available in the schedule of upcoming talks below (for logged-in users) and via the mailing list.

To sign up to our mailing list simply send an empty email to the following address:
@email

If you would like to give a presentation at our seminar, please do not hesitate to contact the organisers Erik Hörmann and Yu Tian. The presentation can be either about your own work or on some (recent) interesting article on networks or on complex systems in general.

In case you missed any of the talks, we will also make recordings of the talks available on our youtube channel.

 

Upcoming Seminars

Tue, 03 Feb 2026
14:00
C3

Exploring partition diversity in complex networks

Dr. Lena Mangold
(IT:U Interdisciplinary Transformation University Austria)
Abstract

Partition diversity refers to the concept that for some networks there may be multiple, similarly plausible ways to group the nodes, rather than one single best partition. In this talk, I will present two projects that address this idea from different but complementary angles. The first introduces the benchmark stochastic cross-block model (SCBM), a generative model designed to create synthetic networks with two distinct 'ground-truth' partitions. This allows us to study the extent to which existing methods for partition detection are able to reveal the coexistence of multiple underlying structures. The second project builds on this benchmark and paves the way for a Bayesian inference framework to directly detect coexisting partitions in empirical networks. By formulating this model as a microcanonical variant of the SCBM, we can evaluate how well it fits a given network compared to existing models. We find that our method more reliably detects partition diversity in synthetic networks with planted coexisting partitions, compared to methods designed to detect a single optimal partition. Together, the two projects contribute to a broader understanding of partition diversity by offering tools to explore the ambiguity of network structure.

Tue, 10 Feb 2026

14:00 - 15:00
C3

Level Sets of Persistent Homology for Point Clouds

Dr. David Beers
(University of California Los Angeles)
Abstract

Persistent homology (PH) is an operation which, loosely speaking, describes the different holes in a point cloud via a collection of intervals called a barcode. The two most frequently used variants of persistent homology for point clouds are called Čech PH and Vietoris-Rips PH. How much information is lost when we apply these kinds of PH to a point cloud? We investigate this question by studying the subspace of point clouds with the same barcodes under these operations. We establish upper and lower bounds on the dimension of this space, and find that the question of when the persistence map is identifiable has close ties to rigidity theory. For example, we show that a generic point cloud being locally identifiable under Vietoris-Rips persistence is equivalent to a certain graph being rigid on the same point cloud.

Tue, 03 Mar 2026
14:00
C3

TBA

Bridget Smart
((Mathematical Institute University of Oxford))
Tue, 10 Mar 2026
14:00
C3

TBA

Márton Pósfai
(Central European University)

You can also find a list of all talks (with abstracts) prior to 2018 here, and the former website
of the Networks journal club at the Oxford complexity center (CABDyN) here.

Unsubscribing?

Simply send an empty email to
@email

Last updated on 29 Nov 2024, 12:47pm. Please contact us with feedback and comments about this page.