Past

Graph signals provide a natural representation of data in many applications, such as social networks, web information analysis, sensor networks, and machine learning. Graph signal & data processing is currently an active field of mathematical research that aims to extend the well-developed tools for analyzing conventional signals to signals on graphs while exploiting the underlying connectivity. A key challenge in this context is the problem of quantization, that is, finding efficient ways of representing the values of graph signals with only a finite number of bits.

In this talk, we address the problem of quantizing bandlimited graph signals. We introduce two classes of noise-shaping algorithms for graph signals that differ in their sampling methodologies. We demonstrate that these algorithms can efficiently construct quantized representatives of bandlimited graph-based signals with bounded amplitude.

Inspired by the results of Zhang et al. in 2022, we provide theoretical guarantees on the relative error between the true signal and its quantized representative for one of the algorithms.
As will be discussed, the incoherence of the underlying graph plays an important role in the quantization process. Namely, bandlimited signals supported on graphs of lower incoherence allow for smaller relative errors. We support our findings with various numerical experiments showcasing the performance of the proposed quantization algorithms for bandlimited signals defined on graphs with different degrees of incoherence.

This is joint work with Felix Krahmer (Technical University of Munich), He Lyu (Meta), Rayan Saab (University of California San Diego), and Rongrong Wang (Michigan State University).

Join us for our first event of term to discuss those topics which are slightly taboo. We’ll be talking about periods, pregnancy, chronic illness, gender identity... This event is open to all but we will be taking extra steps to make sure it is a safe space for everyone. 

Transportation cost spaces are of high theoretical interest,  and they also are fundamental in applications in many areas of applied mathematics, engineering, physics, computer science, finance, and social sciences. 

Obtaining low distortion embeddings of transportation cost spaces into L_1 became important in the problem of finding nearest points, an important research subject in theoretical computer science. After introducing

these spaces we will present some results on upper  and lower estimates of the distortion of embeddings of Transportation Cost Spaces into L_1

Investors fear that surging volumes in short-term, especially same-day expiry (0DTE), options can destabilize markets by propagating large price jumps. Contrary to the intuition that 0DTE sellers predominantly generate delta-hedging flows that aggravate market moves, high open interest gamma in 0DTEs does not propagate past volatility. 0DTEs and underlying markets have become more integrated over time, leading to a marginally stronger link between the index volatility and 0DTE trading. Nonetheless, intraday 0DTE trading volume shocks do not amplify recent past index returns, inconsistent with the view that 0DTEs market growth intensifies market fragility.

About the speaker
Grigory Vilkov, Professor of Finance at the Frankfurt School of Finance and Management, holds an MBA from the University of Rochester and a Ph.D. from INSEAD, with further qualifications from Goethe University Frankfurt. He has been a professor at both Goethe University and the University of Mannheim.
His academic work focused on improving long-term portfolio strategies by building better expectations of risks, returns, and their dynamics. He is known for practical innovations in finance, such as developing forward-looking betas marketed by IvyDB OptionMetrics, establishing implied skewness and generalized lower bounds as cross-sectional stock characteristics, and creating measures for climate change exposure from earnings calls. His current research encompasses factor dispersions, factor and sector rotation, asset allocation with implied data, and machine learning in options analysis. 

Register Here.

While the typical behaviors of stochastic systems are often deceptively oblivious to the tail distributions of the underlying uncertainties, the ways rare events arise are vastly different depending on whether the underlying tail distributions are light-tailed or heavy-tailed. Roughly speaking, in light-tailed settings, a system-wide rare event arises because everything goes wrong a little bit as if the entire system has conspired up to provoke the rare event (conspiracy principle), whereas, in heavy-tailed settings, a system-wide rare event arises because a small number of components fail catastrophically (catastrophe principle). In the first part of this talk, I will introduce the recent developments in the theory of large deviations for heavy-tailed stochastic processes at the sample path level and rigorously characterize the catastrophe principle for such processes. 
The empirical success of deep learning is often attributed to the mysterious ability of stochastic gradient descents (SGDs) to avoid sharp local minima in the loss landscape, as sharp minima are believed to lead to poor generalization. To unravel this mystery and potentially further enhance such capability of SGDs, it is imperative to go beyond the traditional local convergence analysis and obtain a comprehensive understanding of SGDs' global dynamics within complex non-convex loss landscapes. In the second part of this talk, I will characterize the global dynamics of SGDs building on the heavy-tailed large deviations and local stability framework developed in the first part. This leads to the heavy-tailed counterparts of the classical Freidlin-Wentzell and Eyring-Kramers theories. Moreover, we reveal a fascinating phenomenon in deep learning: by injecting and then truncating heavy-tailed noises during the training phase, SGD can almost completely avoid sharp minima and hence achieve better generalization performance for the test data.  

This talk is based on the joint work with Mihail Bazhba, Jose Blanchet, Bohan Chen, Sewoong Oh, Zhe Su, Xingyu Wang, and Bert Zwart.
 

While the typical behaviors of stochastic systems are often deceptively oblivious to the tail distributions of the underlying uncertainties, the ways rare events arise are vastly different depending on whether the underlying tail distributions are light-tailed or heavy-tailed. Roughly speaking, in light-tailed settings, a system-wide rare event arises because everything goes wrong a little bit as if the entire system has conspired up to provoke the rare event (conspiracy principle), whereas, in heavy-tailed settings, a system-wide rare event arises because a small number of components fail catastrophically (catastrophe principle). In the first part of this talk, I will introduce the recent developments in the theory of large deviations for heavy-tailed stochastic processes at the sample path level and rigorously characterize the catastrophe principle for such processes. 

The empirical success of deep learning is often attributed to the mysterious ability of stochastic gradient descents (SGDs) to avoid sharp local minima in the loss landscape, as sharp minima are believed to lead to poor generalization. To unravel this mystery and potentially further enhance such capability of SGDs, it is imperative to go beyond the traditional local convergence analysis and obtain a comprehensive understanding of SGDs' global dynamics within complex non-convex loss landscapes. In the second part of this talk, I will characterize the global dynamics of SGDs building on the heavy-tailed large deviations and local stability framework developed in the first part. This leads to the heavy-tailed counterparts of the classical Freidlin-Wentzell and Eyring-Kramers theories. Moreover, we reveal a fascinating phenomenon in deep learning: by injecting and then truncating heavy-tailed noises during the training phase, SGD can almost completely avoid sharp minima and hence achieve better generalization performance for the test data.  

This talk is based on the joint work with Mihail Bazhba, Jose Blanchet, Bohan Chen, Sewoong Oh, Zhe Su, Xingyu Wang, and Bert Zwart.

While the typical behaviors of stochastic systems are often deceptively oblivious to the tail distributions of the underlying uncertainties, the ways rare events arise are vastly different depending on whether the underlying tail distributions are light-tailed or heavy-tailed. Roughly speaking, in light-tailed settings, a system-wide rare event arises because everything goes wrong a little bit as if the entire system has conspired up to provoke the rare event (conspiracy principle), whereas, in heavy-tailed settings, a system-wide rare event arises because a small number of components fail catastrophically (catastrophe principle). In the first part of this talk, I will introduce the recent developments in the theory of large deviations for heavy-tailed stochastic processes at the sample path level and rigorously characterize the catastrophe principle for such processes. 
The empirical success of deep learning is often attributed to the mysterious ability of stochastic gradient descents (SGDs) to avoid sharp local minima in the loss landscape, as sharp minima are believed to lead to poor generalization. To unravel this mystery and potentially further enhance such capability of SGDs, it is imperative to go beyond the traditional local convergence analysis and obtain a comprehensive understanding of SGDs' global dynamics within complex non-convex loss landscapes. In the second part of this talk, I will characterize the global dynamics of SGDs building on the heavy-tailed large deviations and local stability framework developed in the first part. This leads to the heavy-tailed counterparts of the classical Freidlin-Wentzell and Eyring-Kramers theories. Moreover, we reveal a fascinating phenomenon in deep learning: by injecting and then truncating heavy-tailed noises during the training phase, SGD can almost completely avoid sharp minima and hence achieve better generalization performance for the test data.  

This talk is based on the joint work with Mihail Bazhba, Jose Blanchet, Bohan Chen, Sewoong Oh, Zhe Su, Xingyu Wang, and Bert Zwart.

Bio:

Chang-Han Rhee is an Assistant Professor in Industrial Engineering and Management Sciences at Northwestern University. Before joining Northwestern University, he was a postdoctoral researcher at Centrum Wiskunde & Informatica and Georgia Tech. He received his Ph.D. from Stanford University. His research interests include applied probability, stochastic simulation, experimental design, and the theoretical foundation of machine learning. His research has been recognized with the 2016 INFORMS Simulation Society Outstanding Publication Award, the 2012 Winter Simulation Conference Best Student Paper Award, the 2023 INFORMS George Nicholson Student Paper Competition (2^nd place), and the 2013 INFORMS George Nicholson Student Paper Competition (finalist). Since 2022, his research has been supported by the NSF CAREER Award.  
 

Scientific knowledge, written in the form of differential equations, plays a vital role in various deep learning fields. In this talk, I will present a graph neural network (GNN) design based on reaction-diffusion equations, which addresses the notorious oversmoothing problem of GNNs. Since the self-attention of Transformers can also be viewed as a special case of graph processing, I will present how we can enhance Transformers in a similar way. I will also introduce a spatiotemporal forecasting model based on neural controlled differential equations (NCDEs). NCDEs were designed to process irregular time series in a continuous manner and for spatiotemporal processing, it needs to be combined with a spatial processing module, i.e., GNN. I will show how this can be done. 

The compatibility of local and global Langlands correspondences is a central problem in algebraic number theory. A possible approach to resolving it relies on the existence of global Galois representations with prescribed local monodromy.  I will provide a partial solution by relating the question to its topological analogue. Both the topological and arithmetic version can be solved using the same family of projective hypersurfaces, which was first studied by Dwork.

In this short course, we survey the celebrated weak and strong compactness theorems proved by Karen Uhlenbeck in 1982. These results are fundamental to the gauge theory and have found numerous applications to geometry, topology, and theoretical physics. The proof is based on the ingenious idea of putting connections into ``Uhlenbeck--Coulomb gauge'', which enables the use of standard elliptic and/or nonlinear PDE techniques, as well as involved local-to-global patching arguments. We aim at giving detailed explanation of the proof, and we shall also discuss the relation between Uhlenbeck's compactness and the classical geometric problem of isometric immersions of submanifolds into Euclidean spaces.

The feedback loop between simulations and observations is the driving force behind almost all discoveries in astronomy. However, as technological innovations allow us to create ever more complex simulations and make ever more detailed observations, it becomes increasingly difficult to combine the two: since we cannot do controlled experiments, we need to simulate whatever we can observe. This requires efficient simulation pipelines, including (general-relativistic-)(magneto-)hydrodynamics, particle physics, chemistry, and radiation transport. In this talk, we explore the challenges associated with these modelling efforts and discuss how adopting data-driven surrogate modelling and proper control over model uncertainties, promises to unlock a gold mine of future discoveries. For instance, the application to stellar wind simulations can teach us about the origin of chemistry in our Universe and the building blocks for life, while supernova simulations can reveal exotic states of matter and elucidate the formation black holes.

The notion of biexactness for groups was introduced by Ozawa in 2004 and has since become a major tool used for studying solidity of von Neumann algebras. We introduce the notion of biexactness for von Neumann algebras, which allows us to place many previous solidity results in a more systematic context, and naturally leads to extensions of these results. We will also discuss examples of solid factors that are not biexact. This is a joint work with Jesse Peterson.

 In this short course, we will discuss the Euler equations and applications in gas dynamics and geometry. First, the basic theory of Euler equations and mixed-type problems will be reviewed. Then we will present the results on the transonic flows past obstacles, transonic flows in the fluid dynamic formulation of isometric embeddings, and the transonic flows in nozzles. We will discuss global solutions and stability obtained through various techniques and approaches. The short course consists of three parts and is accessible to PhD students and young researchers.

Dynamical interface motions are important flow patterns and fundamental free boundary problems in fluid mechanics, and have attracted huge attention in the mathematical community. Such waves for purely inviscid fluids are subject to various instabilities such as Kelvin-Helmholtz and Rayleigh-Taylor instabilities unless other stabilizing effects such as surface tension, Taylor-sign conditions or dissipations are imposed. However, in the presence of magnetic fields, it has been known that tangential magnetic fields may have stabilizing effects for free surface waves such as plasma-vacuum or plasma-plasma interfaces (at least locally in time), yet whether transversal magnetic fields (which occurs often for interfacial waves for astrophysical plasmas) can stabilize typical free interfacial waves remain to be some open problems. In this talk, I will show the stabilizing effects of the transversal magnetic fields for some interfacial waves for both compressible and incompressible multi-dimensional magnetohydrodynamics (MHD).

First, I will present the local (in time) well-posedness in Sobolev space of multi- dimensional compressible MHD contact discontinuities, which are the most typical interfacial waves for astrophysical plasma and prototypical fundamental waves for systems of hyperbolic conservations. Such waves are characteristic discontinuities for which there is no flow across the discontinuity surface while the magnetic field crosses transversally, which leads to a two-phase free boundary problem that may have nonlinear Rayleigh- Taylor instability and whose front symbols have no ellipticity. We overcome such difficulties by exploiting full the transversality of the magnetic fields and designing a nonlinear approximate problem, which yields the local well-posed without loss of derivatives and without any other conditions such as Rayleigh-Taylor sign conditions or surface tension. Second, I will discuss some results on the global well-posedness of free interface problems for the incompressible inviscid resistive MHD with transversal magnetic fields. Both plasma-vacuum and plasma-plasma interfaces are studied. The global in time well-posedness of both interface problems in a horizontally periodic slab impressed by a uniform non-horizontal magnetic field near an equilibrium are established, which reveals the strong stabilizing effect of the transversal field as the global well- posedness of the free boundary incompressible Euler equations (without the irrotational assumptions) around an equilibrium is unknown. This talk is based on joint work with Professor Yanjin Wang. 

Apart from the binomial coefficients which are ubiquitous in many counting problems, the Catalan and Fibonacci sequences seem to appear almost as frequently. There are also well-known interpretations of the Catalan numbers as lattice paths, or as the number of ways of connecting 2n points on a circle via non-intersecting lines. We start by obtaining some identities for sums involving the Catalan sequence. In addition, we use the beautiful binomial transform which allows us to obtain several pretty identities involving Fibonacci numbers, Catalan numbers, and trigonometric sums.

Speaker: James Taylor
Title: D-Modules and p-adic Representations

Abstract: The representation theory of finite groups is a beautiful and well-understood subject. However, when one considers more complicated groups things become more interesting, and to classify their representations is often a much harder problem. In this talk, I will introduce the classical theory, the particular groups I am interested in, and explain how one might hope to understand their representations through the use of D-modules - the algebraic incarnation of differential equations.

Speaker: Anthony Webster
Title: An Introduction to Epidemiology and Causal Inference

Abstract: This talk will introduce epidemiology and causal inference from the perspective of a statistician and former theoretical physicist. Despite their studies being underpinned by deep and often complex mathematics, epidemiologists are generally more concerned by seemingly mundane information about the relationships between potential risk factors and disease. Because of this, I will argue that a good epidemiologist with minimal statistical knowledge, will often do better than a highly trained statistician. I will also argue that causal assumptions are a necessary part of epidemiology, should be made more explicitly, and allow a much wider range of causal inferences to be explored. In the process, I will introduce ideas from epidemiology and causal inference such as Mendelian Randomisation and the "do calculus", methodological approaches that will increasingly underpin data-driven population research.  

Training deep learning models involves searching for a good model over the space of possible architectures and their parameters. Discovering models that exhibit robust generalization to unseen data and tasks is of paramount for accurate and reliable machine learning. Generalization, a hallmark of model efficacy, is conventionally gauged by a model's performance on data beyond its training set. Yet, the reliance on vast training datasets raises a pivotal question: how can deep learning models transcend the notorious hurdle of 'memorization' to generalize effectively? Is it feasible to assess and guarantee the generalization prowess of deep neural networks in advance of empirical testing, and notably, without any recourse to test data? This inquiry is not merely theoretical; it underpins the practical utility of deep learning across myriad applications. In this talk, I will show that scrutinizing the training dynamics of neural networks through the lens of topology, specifically using 'persistent-homology dimension', leads to novel bounds on the generalization gap and can help demystifying the inner workings of neural networks. Our work bridges deep learning with the abstract realms of topology and learning theory, while relating to information theory through compression.

Bone regeneration processes are complex multiscale intrinsic mechanisms in bone tissue whose primary outcome is restoring function and form to a bone insufficiency. The effect of mechanics on the newly formed bone (the woven bone), is fundamental, at the tissue, cellular or even molecular scale. However, at these multiple scales, the identification of the mechanical parameters and their mechanisms of action are still unknown and continue to be investigated. This concept of mechanical regulation of biological processes is the main premise of mechanobiology and is used in this seminar to understand the multiscale response of the woven bone to mechanical factors in different bone regeneration processes: bone transport, bone lengthening and tissue engineering. The importance of a multidisciplinary approach that includes both in vivo and in silico modeling will be remarked during the seminar.

String topology is an umbrella under which lives a family of algebraic structures on the homology of the (compact-open) loop space of a closed smooth manifold, M. Of great interest are the string product and coproduct, in view of the failure of the latter to be a homotopy invariant. We will discuss some existing algebraic and geometric perspectives on these operations, and give some examples that probe the extent to which the string coproduct fails to be a homotopy invariant. We will sketch an alternative point of view on string topology as the study of the derived bornological smooth loop stack and explain why this is a promising model for the observed phenomena of string topology.

Predicting real-world phenomena often requires an understanding of their causal relations, not just their statistical associations. I will begin this talk with a brief introduction to the field of causal inference in the classical case of structural causal models over directed acyclic graphs, and causal discovery for static variables. Introducing the temporal dimension results in several interesting complications which are not well handled by the classical framework. The main component of a constraint-based causal discovery procedure is a statistical hypothesis test of conditional independence (CI). We develop such a test for stochastic processes, by leveraging recent advances in signature kernels. Then, we develop constraint-based causal discovery algorithms for acyclic stochastic dynamical systems (allowing for loops) that leverage temporal information to recover the entire directed graph. Assuming faithfulness and a CI oracle, our algorithm is sound and complete. We demonstrate strictly superior performance of our proposed CI test compared to existing approaches on path-space when tested on synthetic data generated from SDEs, and discuss preliminary applications to finance. This talk is based on joint work with Georg Manten, Cecilia Casolo, Søren Wengel Mogensen, Cristopher Salvi and Niki Kilbertus: https://arxiv.org/abs/2402.18477 .

We introduce the notion of a tensorially absorbing inclusion of C*-algebras, i.e., when a unital inclusion absorbs a strongly self-absorbing C*-algebra. This is a strong condition that ensures certain properties of both algebras (and their intermediate subalgebras) in a very strong sense. We discuss such inclusions, their non-triviality, and how often these inclusions appear.

Junior Strings is a seminar series where DPhil students present topics of common interest that do not necessarily overlap with their own research area. This is primarily aimed at PhD students and post-docs but everyone is welcome.

Many researchers are developing stable and accurate numerical methods for flow problems, which roughly belong to upwind methods or characteristics(-based) methods. 
The Lagrange-Galerkin method proposed and analyzed in, e.g., [O. Pironneau. NM, 1982] and [E. S\"uli. NM, 1988] is the finite element method combined with the idea of the method of characteristics; hence, it belongs to the characteristics(-based) methods. The advantages are the CFL-free robustness for convection-dominated problems and the symmetry of the resulting coefficient matrix. In this talk, we introduce stabilized Lagrange-Galerkin schemes of second order in time for viscous and viscoelastic flow problems, which employ the cheapest conforming P1-element with the help of pressure-stabilization [F. Brezzi and J. Pitk\"aranta. Vieweg+Teubner, 1984] for all the unknown functions, i.e., velocity, pressure, and conformation tensor, reducing the number of DOFs. 
Focusing on the recent developments of discretizations of the (non-conservative and conservative) material derivatives and the upper-convected time derivative, we present theoretical and numerical results.

The Fokker-Planck equation is one of the major tools of statistical physics in the description of stochastic processes, with numerous applications in physics, chemistry and biology. In the case of heterogeneous diffusions, the formulation of the equation depends on the choice of the discretization of the stochastic integral in the underlying Langevin-equation due to the multiplicative noise. In the Fokker-Planck equation, the choice of discretization then enters as a parameter in the definition of drift and diffusion terms. I show how both short- and long-time limits are affected by this choice. In the long-time limit, the existence of normalizable probability distribution functions is not always guaranteed which can be remedied by invoking elements of infinite ergodic theory. 

[1] S. Giordano, F. Cleri, R. Blossey, Phys Rev E 107, 044111 (2023)

[2] T. Dupont, S. Giordano, F. Cleri, R. Blossey, arXiv:2401.01765 (2024)

Aggregation-diffusion equations and systems have garnered much attention in the last few decades. More recently, models featuring nonlocal interactions through spatial convolution have been applied to several areas, including the physical, chemical, and biological sciences. Typically, one can establish the well-posedness of such models via regularity assumptions on the kernels themselves; however, more effort is required for many scenarios of interest as the nonlocal kernel is often discontinuous.

In this talk, I will present recent progress in establishing a robust well-posedness theory for a class of nonlocal aggregation-diffusion models with minimal regularity requirements on the interaction kernel in any spatial dimension on either the whole space or the torus. Starting with the scalar equation, we first establish the existence of a global weak solution in a small mass regime for merely bounded kernels. Under some additional hypotheses, we show the existence of a global weak solution for any initial mass. In typical cases of interest, these solutions are unique and classical. I will then discuss the generalisation to the $n$-species system for the regimes of small mass and arbitrary mass. We will conclude with some consequences of these theorems for several models typically found in ecological applications.

This is joint work with Dr. Jakub Skrzeczkowski and Prof. Jose Carrillo.

I will talk about some model-theoretic properties of Booleanizations of theories, subdirect products of structures, and sheaves of structures. I will discuss a result of Macintyre from 1973 on model-completeness, and more recent results jointly with Ehud Hrushovski and with Angus Macintyre.

Ancient Egypt is credited (along with Mesopotamia) for providing the oldest extant mathematical texts. Since the 19th century, when the first edition of the Rhind mathematical papyrus was published, it has held an important role in the historiography of mathematics. One of the earliest researchers in the field of ancient Egyptian sciences was Otto Neugebauer who has been a major influence on the early development of the field. While research in Egyptian mathematics initially focused on those aspects that could be linked to its possible successors in modern mathematics, research has also revealed various characteristics that could not easily be transferred into a modern equivalent. In addition, research on other sciences, like medicine and astronomy, has yielded further evidence that a limitation on those aspects that have successors in modern sciences will at best give an incomplete picture of ancient scholarship. This will be explored in a new long-term project, which is briefly sketched. In the context of this project, Egyptian mathematics is also studied. The talk will present an example from the terminology used in Egyptian mathematical texts to describe this area of knowledge and explore its epistemological consequences for our studies of ancient Egyptian mathematics and aim to situate it in its ancient context.

We will give a relaxed introduction to some of the most classical dynamical systems - Anosov flows. These flows were highly influential in the development of ideas which the audience might be more familiar with. For example, Anosov flows give rise to exponential group growth and taut foliations, both of which we will discuss. Finally, we will talk about some recent work obstructing Anosov flows and their combinatorial analogs - veering triangulations

In the world of von Neumann algebras, the factors that do not have a trace, the so-called type III factors, are the most difficult to study. Some of their key structural properties are still not well-understood. In this talk, I will give a gentle introduction to Connes's Bicentralizer Problem, which is the most important open problem in the theory of type III factors. I will then present some recent progress on this problem and its applications.

We will present a matching upper and lower bound for the right tail probability of the maximum of a random model of the Riemann zeta function over short intervals.  In particular, we show that the right tail interpolates between that of log-correlated and IID random variables as the interval varies in length. We will also discuss a new normalization for the moments over short intervals. This result follows the recent work of Arguin-Dubach-Hartung and is inspired by a conjecture by Fyodorov-Hiary-Keating on the local maximum over short intervals.

Stable commutator length is a measure of homological complexity of group elements, which is known to take large values in the presence of various notions of negative curvature. We will present a new geometric proof of a theorem of Heuer on sharp lower bounds for scl in right-angled Artin groups. Our proof relates letter-quasimorphisms (which are analogues of real-valued quasimorphisms with image in free groups) to negatively curved angle structures for surfaces estimating scl.

We consider the problem of approximating singular values of a matrix when provided with approximations to the leading singular vectors. In particular, we focus on the Generalized Nystrom (GN) method, a commonly used low-rank approximation, and its error in extracting singular values. Like other approaches, the GN approximation can be interpreted as a perturbation of the original matrix. Up to orthogonal transformations, this perturbation has a peculiar structure that we wish to exploit. Thus, we use the Jordan-Wieldant Theorem and similarity transformations to generalize a matrix perturbation theory result on eigenvalues of a perturbed Hermitian matrix. Finally, combining the above,  we can derive a bound on the GN singular values approximation error. We conclude by performing preliminary numerical examples. The aim is to heuristically study the sharpness of the bound, to give intuitions on how the analysis can be used to compare different approaches, and to provide ideas on how to make the bound computable in practice.

The talk introduces an analytical framework for examining socio-spatial segregation across various spatial scales. This framework considers regional connectivity and population distribution, using an information theoretic approach to measure changes in socio-spatial segregation patterns across scales. It identifies scales where both high segregation and low connectivity occur, offering a topological and spatial perspective on segregation. Illustrated through a case study in Ecuador, the method is demonstrated to identify disconnected and segregated regions at different scales, providing valuable insights for planning and policy interventions.

A colouring rule is a way to colour the points $x$ of a probability space according to the colours of finitely many measure preserving tranformations of $x$. The rule is paradoxical if the rule can be satisfied a.e. by some colourings, but by none whose inverse images are measurable with respect to any finitely additive extension for which the transformations remain measure preserving. We show that proper graph colouring as a rule can be paradoxical. And we demonstrate rules defined via optimisation that are paradoxical. A connection to measure theoretic paradoxes is established.

For any smooth complex variety Y with an action of a finite group W, Etingof defines the global Cherednik algebra H_c and its spherical subalgebra B_c as certain sheaves of algebras over Y/W. When Y is an n-dimensional abelian variety, the algebra of global sections of B_c is a polynomial algebra on n generators, as shown by Etingof, Felder, Ma, and Veselov. This defines an integrable system on Y. In the case of Y being a product of n copies of an elliptic curve E and W=S_n, this reproduces the usual elliptic Calogero­­--Moser system. Recently, together with P. Argyres and Y. Lu, we proposed that many of these integrable systems at the classical level can be interpreted as Seiberg­­--Witten integrable systems of certain super­symmetric quantum field theories. I will describe our progress in understanding this connection for groups W=G(m, 1, n), corresponding to the case Y=E^n where E is an elliptic curves with Z_m symmetry, m=2,3,4,6. 

The Nyström method offers an effective way to obtain low-rank approximation of SPD matrices, and has been recently extended and analyzed to nonsymmetric matrices (leading to the randomized, single-pass, streamable, cost-effective, and accurate alternative to the randomized SVD, and it facilitates the computation of several matrix low-rank factorizations. In this presentation, we take these advancements a step further by introducing a higher-order variant of Nyström's methodology tailored to approximating low-rank tensors in the Tucker format: the multilinear Nyström technique. We show that, by introducing appropriate small modifications in the formulation of the higher-order method, strong stability properties can be obtained. This algorithm retains the key attributes of the generalized Nyström method, positioning it as a viable substitute for the randomized higher-order SVD algorithm.

In this talk, I describe an exact duality between the double scaling limit of the SYK model and quantum geometry of de Sitter spacetime in three dimensions. The duality maps the so-called chord rules that specify the exact SYK correlations functions to the skein relations that govern the topological interactions between world-line operators in 3D de Sitter gravity.

This talk is part of the series of Willis Lamb Lectures in Theoretical Physics. Herman Verlinde is the Lamb Lecturer of 2024.

The massive planar Gaussian free field (GFF) is a random distribution defined on a subset of the complex plane. As a random distribution, this field a priori does not have well-defined level lines. In this talk, we give a meaning to this concept by constructing a coupling between a massive GFF and a random collection of loops, called massive CLE_4, in which the loops can naturally be interpreted as the level lines of the field. This coupling is constructed by appropriately reweighting the law of the standard GFF-CLE_4 coupling and this construction can be seen as a conditional version of the path-integral formulation of the massive GFF. We then relate massive CLE_4 to a massive version of the Brownian loop soup. This provides a more direct construction of massive CLE_4 and proves a conjecture of Camia.

A subset in the ideal boundary of a CAT(0) space is called symmetric if every complete geodesic with one ideal boundary point
in the set has both ideal boundary points in the set. In the late 80s Eberlein proved that if a Hadamard manifold contains a non-trivial closed symmetric  subset in its ideal boundary, then its holonomy group cannot act transitively. This leads to rigidty via
the Berger-Simons Theorem. I will discuss rigidity of ideal symmetric sets in the general context of locally compact geodesically complete
CAT(0) spaces.
 

Inspired by questions concerning the evolution of phase fields, we study the Allen-Cahn equation in dimension 2 with white noise initial datum. In a weak coupling regime, where the nonlinearity is damped in relation to the smoothing of the initial condition, we prove Gaussian fluctuations. The effective variance that appears can be described as the solution to an ODE. Our proof builds on a Wild expansion of the solution, which is controlled through precise combinatorial estimates. Joint works with Simon Gabriel, Martin Hairer, Khoa Lê and Nikos Zygouras.

Many practical Bayesian inference problems fall into the simulation-based or "likelihood-free" setting, where evaluations of the likelihood function or prior density are unavailable or intractable; instead one can only draw samples from the joint parameter-data prior. Learning conditional distributions is essential to the solution of these problems. 
To this end, I will discuss a powerful class of methods for conditional density estimation and conditional simulation based on transportation of measure. An important application for these methods lies in data assimilation for dynamical systems, where transport enables new approaches to nonlinear filtering and smoothing. 
To illuminate some of the theoretical underpinnings of these methods, I will discuss recent work on monotone map representations, optimization guarantees for learning maps from data, and the statistical convergence of transport-based density estimators.
 

Neural network architectures play a key role in determining which functions are fit to training data and the resulting generalization properties of learned predictors. For instance, imagine training an overparameterized neural network to interpolate a set of training samples using weight decay; the network architecture will influence which interpolating function is learned. 

In this talk, I will describe new insights into the role of network depth in machine learning using the notion of representation costs – i.e., how much it “costs” for a neural network to represent some function f. Understanding representation costs helps reveal the role of network depth in machine learning. First, we will see that there is a family of functions that can be learned with depth-3 networks when the number of samples is polynomial in the input dimension d, but which cannot be learned with depth-2 networks unless the number of samples is exponential in d. Furthermore, no functions can easily be learned with depth-2 networks while being difficult to learn with depth-3 networks. 

Together, these results mean deeper networks have an unambiguous advantage over shallower networks in terms of sample complexity. Second, I will show that adding linear layers to a ReLU network yields a representation cost that favors functions with latent low-dimension structure, such as single- and multi-index models. Together, these results highlight the role of network depth from a function space perspective and yield new tools for understanding neural network generalization. 

I shall say some stuff about quasilinear reaction-diffusion equations, motivated by tissue growth in particular.