C3

Networks provide a powerful language to model and analyse interconnected systems. Their building blocks are  edges, which can  then be combined to form walks and paths, and thus define indirect relations between distant nodes and model flows across the system. In a traditional setting, network models are first-order, in the sense that flow across nodes is made of independent sequences of transitions. However, real-world systems often exhibit higher-order dependencies, requiring more sophisticated models. Here, we propose a variable-order network model that captures memory effects by interpolating between first- and second-order representations. Our method identifies latent modes that explain second-order behaviors, avoiding overfitting through a Bayesian prior. We introduce an interpretable measure to balance model size and description quality, allowing for efficient, scalable processing of large sequence data. We demonstrate that our model captures key memory effects with minimal state nodes, providing new insights beyond traditional first-order models and avoiding the computational costs of existing higher-order models.

A classical result of Dixmier and Douady enables us to classify locally trivial bundles of C*-algebras with compact operators as fibres via methods in homotopy theory. Dadarlat and Pennig have shown that this generalises to the much larger family of bundles of stabilised strongly self-absorbing C*-algebras, which are classified by the first group of the cohomology theory associated to the units of complex topological K-theory. Building on work of Evans and Pennig I consider Z/pZ-equivariant C*-algebra bundles over Z/pZ-spaces. The fibres of these bundles are infinite tensor products of the endomorphism algebra of a Z/pZ-representation. In joint work with Pennig, we show that the theory refines completely to this equivariant setting. In particular, we prove a full classification of the C*-algebra bundles via equivariant stable homotopy theory.

A successful strategy to handle problems involving primes is to approximate them by a more 'simple' function. Two aspects need to be balanced. On the one hand, the approximant should be simple enough so that the considered problem can be solved for it. On the other hand, it needs to be close enough to the primes in order to make it an admissible to replacement. In this talk I will present how one can construct general approximants in the context of the Circle Method and will use this to give a different perspective on Goldbach type applications.

Self-similar groups are groups of automorphisms of infinite rooted trees obeying a simple but powerful rule. Under this rule, groups with exotic properties can be generated from very basic starting data, most famously the Grigorchuk group which was the first example of a group with intermediate growth.

Nekrashevych introduced a groupoid and a C*-algebra for a self-similar group action on a tree as models for some underlying noncommutative space for the system. Our goal is to compute the K-theory of the C*-algebra and the homology of the groupoid. Our main theorem provides long exact sequences which reduce the problems to group theory. I will demonstrate how to apply this theorem to fully compute homology and K-theory through the example of the Grigorchuk group.

This is joint work with Benjamin Steinberg.

Given two von Neumann algebras A,B with an action by a locally compact (quantum) group G, one can consider its associated equivariant correspondences, which are usual A-B-correspondences (in the sense of Connes) with a compatible unitary G-representation. We show how the category of such equivariant A-B-correspondences carries an analogue of the Fell topology, which is preserved under natural operations (such as crossed products or equivariant Morita equivalence). If time permits, we will discuss one particular interesting example of such a category of equivariant correspondences, which quantizes the representation category of SL(2,R). This is based on joint works with Joeri De Ro and Joel Dzokou Talla. 

A trace on a group is a positive-definite conjugation-invariant function on it. These traces correspond to tracial states on the group's maximal  C*-algebra. In the past couple of decades, the study of traces has led to exciting connections to the rigidity, stability, and dynamics of groups. In this talk, I will explain these connections and focus on the topological structure of the space of traces of some groups. We will see the different behaviours of these spaces for free groups vs. higher-rank lattices, and how our strategy for the free group can be used to answer a question of Musat and Rørdam regarding free products of matrix algebras. This is based on joint works with Arie Levit, Joav Orovitz, and Itamar Vigdorovich.

Kirchhoff's celebrated matrix tree theorem expresses the number of spanning trees of a graph as the maximal minor of the Laplacian matrix of the graph. In modern language, this determinantal counting formula reflects the fact that spanning trees form a regular matroid. In this talk, I will give a short historical overview of the tree-counting problem and a related quantity from electrical circuit theory: the effective resistance. I will describe a characterization of effective resistances in terms of a certain polytope and discuss some recent applications to discrete notions of curvature on graphs. More details can be found in the recent preprint: https://arxiv.org/abs/2410.07756

TBC