Past

Equivariant Jiang-Su stability is an important regularity property for group actions on C*-algebras.  In this talk, I will explain this property and how it arises naturally in the context of the classification of C*-algebras and their actions. Depending on the time, I will then explain a bit more about the nature of equivariant Jiang- Su stability and the kind of techniques that are used to study it, including a recent result of Gábor Szabó and myself establishing an equivalence with equivariant property Gamma under certain conditions.
 

Neural networks are the most practically successful class of models in modern machine learning, but there are considerable gaps in the current theoretical understanding of their properties and success. Several authors have applied models and tools from random matrix theory to shed light on a variety of aspects of neural network theory, however the genuine applicability and relevance of these results is in question. Most works rely on modelling assumptions to reduce large, complex matrices (such as the Hessians of neural networks) to something close to a well-understood canonical RMT ensemble to which all the sophisticated machinery of RMT can be applied to yield insights and results. There is experimental work, however, that appears to contradict these assumptions. In this talk, we will explore what can be derived about neural networks starting from RMT assumptions that are much more general than considered by prior work. Our main results start from justifiable assumptions on the local statistics of neural network Hessians and make predictions about their spectra than we can test experimentally on real-world neural networks. Overall, we will argue that familiar ideas from RMT universality are at work in the background, producing practical consequences for modern deep neural networks.

Consider a random group $\Gamma$ with $k$ generators and $r$ random relators of large length $N$. We study the geometry of the character variety of $\Gamma$ with values in $\SL(2,\C)$ or more generally any semisimple Lie group $G$. This is the moduli space of group homomorphisms from $\Gamma$ to $G$ up to conjugation. We are in particular able to determine its dimension, number of components and Galois group, with an excellent control on the probability of exceptions. The proofs use effective Chebotarev type theorems as well as new spectral gap bounds  for Cayley graphs of finite simple groups. They are also conditional on GRH. Joint work with Peter Varju and Oren Becker.

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states (i.e. present or not present) of the edges in $S_1$ are independent of the states of the edges in $S_2$. Such models typically arise in renormalisation arguments applied to independent percolation models, or percolation models with finite range dependencies. A 1-independent model is said to percolate if the random subgraph has an infinite component with positive probability. In 2012 Balister and Bollobás defined $p_{\textrm{max}}(G)$ to be the supremum of those $p$ for which there exists a 1-independent bond percolation model on $G$ in which each edge is present in the random subgraph with probability at least $p$ but which does not percolate. A fundamental and challenging problem in this area is to determine, or give good bounds on, the value of $p_{\textrm{max}}(G)$ when $G$ is the lattice graph $\mathbb{Z}^2$. Since $p_{\textrm{max}}(\mathbb{Z}^n)\leq p_{\textrm{max}}(\mathbb{Z}^{n-1})$, it is also of interest to establish the value of $\lim_{n\to\infty}p_{\textrm{max}}(\mathbb{Z}^n)$.

In this talk we will present a significantly improved upper bound for this limit as well as improved upper and lower bounds for $p_{\textrm{max}}(\mathbb{Z}^2)$. We will also show that with high confidence we have $p_{\textrm{max}}(\mathbb{Z}^n)<p_{\textrm{max}}(\mathbb{Z}^2)$ for large $n$ and discuss some open problems concerning 1-independent models on other graphs.

This is joint work with Tom Johnston and Alex Scott.

Harish-Chandra's Lefschetz principle suggests that representations of real and p-adic split reductive groups are closely related, even though the methods used to study these groups are quite different. The local Langlands correspondence (as formulated by Vogan) indicates that these representation theoretic relationships stem from geometric relationships between real and p-adic Langlands parameters. In this talk we will discuss how the geometric structure of real and p-adic Langlands parameters lead to functorial relationships between representations of real and p-adic groups. I will describe work in progress which applies this functoriality to the study of unitary representations and signatures of invariant hermitian forms for GL(n). The main result expresses signatures of invariant hermitian forms on graded affine Hecke algebra modules in terms of signature characters of Harish-Chandra modules, which are computable via the unitary algorithm for real reductive groups by Adams-van Leeuwen-Trapa-Vogan.

Molecules can be broken apart with a high-powered laser or an electron beam. The position of charged fragments can then be detected on a screen. From the mass to charge ratio, the identity of the fragments can be determined. The covariance of two fragments then gives us the projection of a distribution related to the initial scattering distribution. We formulate the mathematical transformation from the scattering distribution to the covariance distribution obtained from experiments. We expand the scattering distribution in terms of basis functions to obtain a linear system for the coefficients, which we use to solve the inverse problem. Finally, we show the result of our method on three examples of test data, and also with experimental data.

The synthetic theory of Ricci curvature lower bounds introduced more than 15 years ago by Lott-Sturm-Villani has been largely succesful in describing the geometry of metric measure spaces. However, this theory fails to include sub-Riemannian manifolds (an important class of metric spaces, the simplest example being the so-called Heisenberg group). Motivated by Villani's ``great unification'' program, in this talk we propose an extension of Lott-Sturm-Villani's theory, which includes sub-Riemannian geometry. This is a joint work with Barilari (Padua) and Mondino (Oxford). The talk is intended for a general audience, no previous knowledge of optimal transport or sub-Riemannian geometry is required.

The Balog-Szemerédi-Gowers theorem is a powerful tool in additive combinatorics, that allows one to roughly convert any “large energy” estimate into a “small sumset” estimate. This has found applications in a lot of results in additive combinatorics and other areas. In this talk, we will provide a friendly introduction and overview of this result, and then discuss some proof ideas. No hardcore additive combinatorics pre-requisites will be assumed.

I will present classification results for 4-manifolds with boundary and infinite cyclic fundamental group, obtained in joint work with Anthony Conway and with Conway and Lisa Piccirillo.  Time permitting, I will describe applications to knotted surfaces in simply connected 4-manifolds, and to investigating the difference between the relations of homotopy equivalence and stable homeomorphism. These will also draw on work with Patrick Orson and with Conway,  Diarmuid Crowley, and Joerg Sixt.

In this talk, we consider differential equations perturbed by multiplicative fractional Brownian noise. Depending on the value of the Hurst parameter $H$, the resulting equation is pathwise viewed as an ordinary ($H>1$), Young  ($H \in (1/2, 1)$) or rough  ($H \in (1/3, 1/2)$) differential equation. In all three regimes we show regularisation by noise phenomena by proving the strongest kind of well-posedness  for equations with irregular drifts: strong existence and path-by-path uniqueness. In the Young and smooth regime $H>1/2$ the condition on the drift coefficient is optimal in the sense that it agrees with the one known for the additive case.

In the rough regime $H\in(1/3,1/2)$ we assume positive but arbitrarily small drift regularity for strong 
well-posedness, while for distributional drift we obtain weak existence. 

This is a joint work with Máté Gerencsér.

We study the problem of determining when a compact group can be realized as the group of isometries of a norm on a finite dimensional real vector space.  This problem turns out to be difficult to solve in full generality, but we manage to understand the connected groups that arise as connected components of isometry groups. The classification we obtain is related to transitive actions on spheres (Borel, Montgomery-Samelson) on the one hand and to prehomogeneous spaces (Vinberg, Sato-Kimura) on the other. (joint work with Martin Liebeck, Assaf Naor and Aluna Rizzoli)

According to the correspondence principle, classical physics emerges in the limit of large quantum numbers. We examine three examples of the semiclassical description of conformal field theory data: large charge boundary operators in the O(2) model, large spin impurities in the free triplet scalar field theory and large charge Wilson lines in QED. By simultaneously taking the coupling to zero and quantum numbers to infinity, we can connect the microscopic to the emergent classical description smoothly.

Abstract: 

Welcome (back) to Fridays@4! To start the new academic year in this session we’ll introduce what Fridays@4 is for our new students and colleagues. This session will be a chance to meet current students and ECRs from across Maths and Stats who will share their hints and tips on conducting successful research in Oxford. There will be lots of time for questions, discussions and generally meeting more people across the two departments – everyone is welcome!

Discrete structures have a long history of use in applied mathematics. Graphs and hypergraphs provide models of social networks, biological systems, academic collaborations, and much more. Network science, and more recently hypernetwork science, have been used to great effect in analyzing these types of discrete structures. Separately, the field of applied topology has gathered many successes through the development of persistent homology, mapper, sheaves, and other concepts. Recent work by our group has focused on the convergence of these two areas, developing and applying topological concepts to study discrete structures that model real data.

This talk will survey our body of work in this area showing our work in both the theoretical and applied spaces. Theory topics will include an introduction to hypernetwork science and its relation to traditional network science, topological interpretations of graphs and hypergraphs, and dynamics of topology and network structures. I will show examples of how we are applying each of these concepts to real data sets.

Cell fate decision-making is responsible for development and homeostasis, and is dysregulated in disease. Despite great promise, we are yet to harness the high-resolution cell state information that is offered by single-cell genomics data to understand cell fate decision-making as it is controlled by gene regulatory networks. We describe how we leveraged joint dynamics + genomics measurements in single cells to develop a new framework for single-cell-informed Bayesian parameter inference of Ca2+ pathway dynamics in single cells. This work reveals a mapping from transcriptional state to dynamic cell fate. But no cell is an island: cell-internal gene regulatory dynamics act in concert with external signals to control cell fate. We developed a multiscale model to study the effects of cell-cell communication on gene regulatory network dynamics controlling cell fates in hematopoiesis. Specifically, we couple cell-internal ODE models with a cell signaling model defined by a Poisson process. We discovered a profound role for cell-cell communication in controlling the fates of single cells, and show how our results resolve a controversy in the literature regarding hematopoietic stem cell differentiation. Overall, we argue for the need to consider single-cell-resolved models to understand and predict the fates of cells.

For positive integers $k$ and $n$ let $\sigma_k(n)$ denote the sum of the $k$th powers of the divisors of $n$. Erd\H{o}s and Kac conjectured that, for every $k$, the number $\alpha_k = \sum_{n\geq 1} \frac{\sigma_k(n)}{n!}$ is irrational. This is known conditionally for all $k$ assuming difficult conjectures like the Hardy-Littlewood prime $k$-tuples conjecture. Before our work it was known unconditionally that $\alpha_k$ is irrational if $k\leq 3$. We discuss some of the ideas in our recent proof that $\alpha_4$ is irrational. The proof involves sieve methods and exponential sum estimates.

Theory of mean-field games (MFGs) has recently experienced an exponential growth. Existing analytical approaches to find Nash equilibrium (NE) solutions for MFGs are, however, by and large restricted to contractive or monotone settings, or rely on the uniqueness of the NE. We propose a new mathematical paradigm to analyze discrete-time MFGs without any of these restrictions. The key idea is to reformulate the problem of finding NE solutions in MFGs as solving an equivalent optimization problem, called MF-OMO (Mean-Field Occupation Measure Optimization), with bounded variables and trivial convex constraints. It is built on the classical work of reformulating a Markov decision process as a linear program, and by adding the consistency constraint for MFGs in terms of occupation measures, and by exploiting the complementarity structure of the linear program. This equivalence framework enables finding multiple (and possibly all) NE solutions of MFGs by standard algorithms such as projected gradient descent, and with convergence guarantees under appropriate conditions. In particular, analyzing MFGs with linear rewards and with mean-field independent dynamics is reduced to solving a finite number of linear programs, hence solvable in finite time. This optimization reformulation of MFGs can be extended to variants of MFGs such as personalized MFGs.

I will discuss the following statement, a definable version of the (p,q) theorem of Jiří Matoušek from combinatorics, conjectured by Chernikov and Simon:

Suppose that T is NIP and that phi(x,b) does not fork over a model M. Then there is some formula psi(y) in tp(b/M) such that the partial type {phi(x,b’) : psi(b’)} is consistent.

It has long been appreciated that in QCD-like theories without fundamental matter, confinement can be given a sharp characterization in terms of symmetry. More recently, such symmetries have been identified as 1-form symmetries, which fit into the broader category of generalized global symmetries.  In this talk I will discuss obstructions to the existence of a 1-form symmetry in large N QCD, where confinement is a sharp notion. I give general arguments for this disconnect between 1-form symmetries and confinement, and use 2d scalar QCD on the lattice as an explicit example.  

Hilbert complexes are chains of spaces linked by operators, with properties that are crucial to establishing the well-posedness of certain systems of partial differential equations. Designing stable numerical schemes for such systems, without resorting to nonphysical stabilisation processes, requires reproducing the complex properties at the discrete level. Finite-element complexes have been extensively developed since the late 2000's, in particular by Arnold, Falk, Winther and collaborators. These are however limited to certain types of meshes (mostly, tetrahedral and hexahedral meshes), which limits options for, e.g., local mesh refinement.

In this talk we will introduce the Discrete De Rham complex, a discrete version of one of the most popular complexes of differential operators (involving the gradient, curl and divergence), that can be applied on meshes consisting of generic polytopes. We will use a simple magnetostatic model to motivate the need for (continuous and discrete) complexes, then give a presentation of the lowest-order version of the complex and sketch its links with the CW cochain complex on the mesh. We will then briefly explain how this lowest-order version is naturally extended to an arbitrary-order version, and briefly present the associated properties (Poincaré inequalities, primal and adjoint consistency, commutation properties, etc.) that enable the analysis of schemes based on this complex.

Come along for free pizza and to hear about the Mathematrix events this term.

We present a framework to generate and evaluate thematic recommendations based on multilayer network representations of knowledge graphs (KGs).  We represent the relative importance of different types of connections (e.g., Directing/acting) with an intuitive salience matrix that can be learnt from data, tuned to incorporate domain knowledge, address different use cases, or respect business logic. We apply an adaptation of the personalised PageRank algorithm to multilayer network models of KGs to generate item-item recommendations. These recommendations reflect the knowledge we hold about the content, and are suitable for thematic or cold-start settings.

Evaluating thematic recommendations from user data presents unique challenges. Our method only recommends items that are 'thematically' related; that is, easily reachable following connections in the KG. We develop a variant of the widely-used Normalised Discounted Cumulative Gain (NDCG) to evaluate recommendations based on user-item ratings, respecting their thematic nature.

We apply our methods to a KG of the movie industry and MovieLens ratings and in an internal AB test. We learn the salience matrix and demonstrate that our approach outperforms existing thematic recommendation methods and is competitive with collaborative filtering approaches.

Profinite rigidity is essentially the study of which groups can be distinguished from each other by their finite quotients. This talk is meant to give a gentle introduction to the area - I will explain which questions are the right ones to ask and give an overview of some of the main results in the field. I will assume knowledge of what a group presentation is.

In this talk, I will discuss the notion of quantum limits from different viewpoints: Cordes' work on the Gelfand theory for pseudo-differential operators dating from the 70’s as well as the micro-local defect measures and semi-classical measures of the 90’s. I will also explain my motivation and strategy to obtain similar notions in subRiemannian or subelliptic settings. 

I will describe the interaction between a single soliton and a gas of solitons, providing for the first time a mathematical justification for the kinetic theory as posited by Zakharov in the 1970s.  Then I will explain how to use random matrix theory to introduce randomness into a large collection of solitons.