University of Cambridge

The statistical analysis of data which lies in a non-Euclidean space has become increasingly common over the last decade, starting from the point of view of shape analysis, but also being driven by a number of novel application areas. However, while there are a number of interesting avenues this analysis has taken, particularly around positive definite matrix data and data which lies in function spaces, it has increasingly raised more questions than answers. In this talk, I'll introduce some non-Euclidean data from applications in brain imaging and in linguistics, but spend considerable time asking questions, where I hope the interaction of statistics and topological data analysis (understood broadly) could potentially start to bring understanding into the applications themselves.

We consider, in a framework of iterated random conformal maps, a two-parameteraggregation model of Hastings-Levitov type, in which the size and intensity of new particles are each chosen to vary as a power of the density of harmonic measure. Then we consider a limit
in which the overall intensity of particles become large, while the particles themselves become
small. For a certain `sub-critical' range of parameter values, we can show a law of large numbers and fluctuation central limit theorem. The admissible range of parameters includes an off-lattice version of the Eden model, for which we can show that disk-shaped clusters are stable.
Many open problem remain, not least because the limit PDE does not yet have a satisfactory mathematical theory.

This is joint work with Vittoria Silvestri and Amanda Turner.

The dynamics of quantum many-body systems is intricately related to random matrix theory (RMT), to such a degree that quantum chaos is even defined through random matrix level statistics. However, exact results on this connection are typically precluded by the exponentially large Hilbert space. After a short introduction to the role of RMT in many-body dynamics, I will show how dual-unitary circuits present a minimal model of quantum chaos where this connection can be made rigorous. This will be illustrated using a new kind of emergent random matrix behaviour following a quantum quench: starting from a time-evolved state, an ensemble of pure states supported on a small subsystem can be generated by performing projective measurements on the remainder of the system, leading to a projected ensemble. In chaotic quantum systems it was conjectured that such projected ensembles become indistinguishable from the uniform Haar-random ensemble and lead to a quantum state design, which can be shown to hold exactly in dual-unitary circuit dynamics.

We derive quantitatively the weak and strong Harnack inequality for kinetic Fokker--Planck type equations with a non-local diffusion operator for the full range of the non-locality exponents in (0,1).  This implies Hölder continuity.  We give novel proofs on the boundedness of the bilinear form associated to the non-local operator and on the construction of a geometric covering accounting for the non-locality to obtain the Harnack inequalities.  Our results apply to the inhomogeneous Boltzmann equation in the non-cutoff case.

Previous joint work with Caroline Terry had identified model-theoretic stability as a sufficient condition for the existence of strong arithmetic regularity decompositions in finite abelian groups, pioneered by Ben Green around 2003. 
Higher-order arithmetic regularity decompositions, based on Tim Gowers’s groundbreaking work on Szemerédi’s theorem in the late 90s, are an essential part of today's arithmetic combinatorics toolkit.
In this talk, I will describe recent joint work with Caroline Terry in which we define a natural higher-order generalisation of stability and prove that it implies the existence of particularly efficient higher-order arithmetic regularity decompositions in the setting of finite elementary abelian groups. If time permits, I will briefly outline some analogous results we obtain in the context of hypergraph regularity decompositions.

I will present a simple abstract quantitative method for proving the hydrodynamic limit of interacting particle systems on a lattice, both in the hyperbolic and parabolic scaling. In the latter case, the convergence rate is uniform in time. This "consistency-stability" approach combines a modulated Wasserstein-distance estimate comparing the law of the stochastic process to the local Gibbs measure, together with stability estimates à la Kruzhkov in weak distance, and consistency estimates exploiting the regularity of the limit solution. It avoids the use of “block estimates” and is self-contained. We apply it to the simple exclusion process, the zero range process, and the Ginzburg-Landau process with Kawasaki dynamics. This is a joint work with Daniel Marahrens and Angeliki Menegaki (IHES).

The alchemists wanted to create gold, Hilbert wanted an algorithm to solve Diophantine equations, researchers want to make deep learning robust in AI, MATLAB wants (but fails) to detect when it provides wrong solutions to linear programs etc. Why does one not succeed in so many of these fundamental cases? The reason is typically methodological barriers. The history of  science is full of methodological barriers — reasons for why we never succeed in reaching certain goals. In many cases, this is due to the foundations of mathematics. We will present a new program on methodological barriers and foundations of mathematics,  where — in this talk — we will focus on two basic problems: (1) The instability problem in deep learning: Why do researchers fail to produce stable neural networks in basic classification and computer vision problems that can easily be handled by humans — when one can prove that there exist stable and accurate neural networks? Moreover, AI algorithms can typically not detect when they are wrong, which becomes a serious issue when striving to create trustworthy AI. The problem is more general, as for example MATLAB's linprog routine is incapable of certifying correct solutions of basic linear programs. Thus, we’ll address the following question: (2) Why are algorithms (in AI and computations in general) incapable of determining when they are wrong? These questions are deeply connected to the extended Smale’s 9th and 18th problems on the list of mathematical problems for the 21st century. 

Distribution dependent equations (or McKean—Vlasov equations) have found many applications to problems in physics, biology, economics, finance and computer science. Historically, equations with either Brownian noise or zero noise have received the most attention; many well known results can be found in the monographs by A. Sznitman and F. Golse. More recently, attention has been paid to distribution dependent equations driven by random continuous noise, in particular the recent works by M. Coghi, J-D. Deuschel, P. Friz & M. Maurelli, with applications to battery modelling. Furthermore, the phenomenon of regularisation by noise has received new attention following the works of D. Davie and M. Gubinelli & R. Catellier using techniques of averaging along rough trajectories. Building on these ideas I will present recent joint work with L. Galeati and F. Harang concerning well-posedness and stability results for distribution dependent equations driven first by merely continuous noise and secondly driven by fractional Brownian motion.

The Specht modules are of fundamental importance to the representation theory of the symmetric group, and their 0th cohomology is understood through entirely combinatorial methods due to Gordon James. Over fields of odd characteristic, Hemmer proposed a similar combinatorial approach to calculating their 1st degree cohomology, or extensions by the trivial module. This combinatorial approach motivates the definition of universal $p$-ary designs, which we shall classify. We then explore the consequences of this classification to problem of determining extensions of Specht modules. In particular, we classify all extensions of Specht modules indexed by two-part partitions by the trivial module and shall see some far-reaching conditions on when the first cohomology of a Specht module is trivial.