From neurons to random matrices and dynamics
Abstract
This talk will be a survey on the applications of random matrix theory in neuroscience. We will explain why and how we use random matrices to model networks of neurons in the brain. We are mainly interested in the study of neuronal dynamics, and we will present results that cover two parallel directions taken by the field of theoretical neuroscience. First, we will talk about the critical point of transitioning to chaos in cases of random matrices that aim to be more "biologically plausible". And secondly, we will see how a deterministic and a random matrix (corresponding to learned structure and noise in a neuronal network) can interact in a dynamical system.
Functional and Geometric Inequalities via Optimal Transport
Abstract
I will give an overview of the localization technique: a powerful dimension-reduction tool for proving geometric and functional inequalities. Having its roots in a pioneering work of Payne-Weinberger in the 60ies about sharp Poincare’-Wirtinger inequality on Convex Bodies in Rn, recently such a technique found new applications for a range of sharp geometric and functional inequalities in spaces with Ricci curvature bounded below.
Low-dimensional quantum Yang-Mills measures
Abstract
Yang-Mills theory plays an important role in the Standard Model and is behind many mathematical developments in geometric analysis. In this talk, I will present several recent results on the problem of constructing quantum Yang-Mills measures in 2 and 3 dimensions. I will particularly speak about a representation of the 2D measure as a random distributional connection and as the invariant measure of a Markov process arising from stochastic quantisation. I will also discuss the relationship with previous constructions of Driver, Sengupta, and Lévy based on random holonomies, and the difficulties in passing from 2 to 3 dimensions. Partly based on joint work with Ajay Chandra, Martin Hairer, and Hao Shen.
Covering random graphs by monochromatic subgraphs, and related results
How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given r-edge-colored graph G? Such questions go back to the 1960's and have been studied intensively in the past 50 years. In this talk, I will discuss what we know when G is the random graph G(n,p). The problem turns out to be related to the following question of Erdős, Hajnal and Tuza: What is the largest possible cover number of an r-uniform hypergraph where any k edges have a cover of size l.
The results I mention give new bounds for these problems, and answer some questions by Bal and DeBiasio, and others. The talk is based on collaborations with Bucić, Mousset, Nenadov, Škorić and Sudakov.
16:00
Double branched cover of knotoids, f-distance and entanglement in proteins.
Abstract
Knotoids are a generalisation of knots that deals with open curves. In the past few years, they’ve been extensively used to classify entanglement in proteins. Through a double branched cover construction, we prove a 1-1 correspondence between knotoids and strongly invertible knots. We characterise forbidden moves between knotoids in terms of equivariant band attachments between strongly invertible knots, and in terms of crossing changes between theta-curves. Finally, we present some applications to the study of the topology of proteins. This is based on joint works with D.Buck, H.A.Harrington, M.Lackenby and with D. Goundaroulis.
Universal Approximation with Deep Narrow Networks
Abstract
The classical Universal Approximation Theorem certifies that the universal approximation property holds for the class of neural networks of arbitrary width. Here we consider the natural `dual' theorem for width-bounded networks of arbitrary depth, for a broad class of activation functions. In particular we show that such a result holds for polynomial activation functions, making this genuinely different to the classical case. We will then discuss some natural extensions of this result, e.g. for nowhere differentiable activation functions, or for noncompact domains.
16:00
The homology of the mapping class group
Abstract
We will discuss what it means to study the homology of a group via the construction of the classifying space. We will look at some examples of this construction and some of its main properties. We then use this to define and study the homology of the mapping class group of oriented surfaces, focusing on the approach used by Harer to prove his Homology Stability Theorem.
16:00
Immersed surfaces in cubed three manifolds: a prescient vision.
Abstract
When Gromov defined non-positively curved cube complexes no one knew what they would be useful for.
Decades latex they played a key role in the resolution of the Virtual Haken conjecture.
In one of the early forays into experimenting with cube complexes, Aitchison, Matsumoto, and Rubinstein produced some nice results about certain "cubed" manifolds, that in retrospect look very prescient.
I will define non-positively curved cube complexes, what it means for a 3-manifold to be cubed, and discuss what all this Haken business is about.