Mon, 19 Feb 2024
15:30
Lecture room 5

Rough Stochastic Analysis with Jumps

Dr Andy Allan
(University of Durham)
Abstract

Rough path theory provides a framework for the study of nonlinear systems driven by highly oscillatory (deterministic) signals. The corresponding analysis is inherently distinct from that of classical stochastic calculus, and neither theory alone is able to satisfactorily handle hybrid systems driven by both rough and stochastic noise. The introduction of the stochastic sewing lemma (Khoa Lê, 2020) has paved the way for a theory which can efficiently handle such hybrid systems. In this talk, we will discuss how this can be done in a general setting which allows for jump discontinuities in both sources of noise.

Mon, 12 Feb 2024
15:30
Lecture room 5

Regularity of Random Wavelet Series

Dr Céline Esser
(Mathematics Department, Liège University)
Abstract

This presentation focuses on the study of the regulartiy of random wavelet series. We first study their belonging to certain functional spaces and we compare these results with long-established results related to random Fourier series. Next, we show how the study of random wavelet series leads to precise pointwise regularity properties of processes like fractional Brownian motion. Additionally, we explore how these series helps create Gaussian processes  with random Hölder exponents.

Mon, 05 Feb 2024
15:30
Lecture room 5

Stochastic Games of Intensity Control for (Ticket) Pricing

Professor Ronnie Sircar
(Princeton University)
Abstract

One way to capture both the elastic and stochastic reaction of purchases to price is through a model where sellers control the intensity of a counting process, representing the number of sales thus far. The intensity describes the probabilistic likelihood of a sale, and is a decreasing function of the price a seller sets. A classical model for ticket pricing, which assumes a single seller and infinite time horizon, is by Gallego and van Ryzin (1994) and it has been widely utilized by airlines, for instance. Extending to more realistic settings where there are multiple sellers, with finite inventories, in competition over a finite time horizon is more complicated both mathematically and computationally. We discuss some dynamic games of this type, from static to two player to the associated mean field game, with some numerical and existence-uniqueness results.

Based on works with Andrew Ledvina and with Emre Parmaksiz.

Mon, 22 Jan 2024
15:30
Lecture room 5

Nonparametric generative modeling for time series via Schrödinger bridge

Professor Huyên Pham
(Université Paris Cité )
Abstract

We propose a novel generative model for time series based on Schrödinger bridge (SB) approach. This consists in the entropic interpolation via optimal transport between a reference probability measure on path space and a target measure consistent with the joint data distribution of the time series. The solution is characterized by a stochastic differential equation on finite horizon with a path-dependent drift function, hence respecting  the temporal dynamics of the time series distribution. We  estimate the drift function from data samples by nonparametric, e.g. kernel regression methods,  and the simulation of the SB diffusion  yields new synthetic data samples of the time series. The performance of our generative model is evaluated through a series of numerical experiments.  First, we test with autoregressive models, a GARCH Model, and the example of fractional Brownian motion,  and measure the accuracy of our algorithm with marginal, temporal dependencies metrics, and predictive scores. Next, we use our SB generated synthetic samples for the application to deep hedging on real-data sets. 

Mon, 15 Jan 2024
15:30
Lecture room 5

The Critical 2d Stochastic Heat Flow and other critical SPDEs

Professor Nikolaos Zygouras
(Dept. Mathematics, University of Warwick)
Abstract
Thanks to the theories of Paracontrolled Distributions and Regularity structures we now have a complete theory of  singular SPDEs, which are “sub-critical” in the sense of renormalisation. Recently, there have been efforts to approach the situation of “critical” SPDEs and statistical mechanics models. A first such treatment has been through the study of the two-dimensional stochastic heat equation, which has revealed a certain phase transition and has led to the construction of the novel object called the Critical 2d Stochastic Heat Flow. In this talk we will present some aspects of this model and its construction. We will also present developments relating to other critical SPDEs.
Parts of this talk are based on joint works with Caravenna and Sun and others with Rosati and Gabriel.  
Percolation theories for quantum networks
Meng, X Hu, X Tian, Y Dong, G Lambiotte, R Gao, J Havlin, S Entropy volume 25 issue 11 (20 Nov 2023)
A Schanuel property for exponentially transcendental powers
Bays, M Kirby, J Wilkie, A Bulletin of the London Mathematical Society volume 42 issue 5 917-922 (04 Oct 2010)
Thu, 08 Feb 2024
14:00
Lecture Room 3

From Chebfun3 to RTSMS: A journey into deterministic and randomized Tucker decompositions

Behnam Hashemi
(Leicester University)
Abstract
The Tucker decomposition is a family of representations that break up a given d-dimensional tensor into the multilinear product of a core tensor and a factor matrix along each of the d-modes. It is a useful tool in extracting meaningful insights from complex datasets and has found applications in various fields, including scientific computing, signal processing and machine learning. 
 In this talk we will first focus on the continuous framework and revisit how Tucker decomposition forms the foundation of Chebfun3 for numerical computing with 3D functions and the deterministic algorithm behind Chebfun3. The key insight is that separation of variables achieved via low-rank Tucker decomposition simplifies and speeds up lots of subsequent computations.
 We will then switch to the discrete framework and discuss a new algorithm called RTSMS (randomized Tucker with single-mode sketching). The single-mode sketching aspect of RTSMS allows utilizing simple sketch matrices which are substantially smaller than alternative methods leading to considerable performance gains. Within its least-squares strategy, RTSMS incorporates leverage scores for efficiency with Tikhonov regularization and iterative refinement for stability. RTSMS is demonstrated to be competitive with existing methods, sometimes outperforming them by a large margin.
We illustrate the benefits of Tucker decomposition via MATLAB demos solving problems from global optimization to video compression. RTSMS is joint work with Yuji Nakatsukasa.

Round-table conversation between women scientists of the Brasenose Fellowship about their careers and research and the particular challenges they have faced. 

Subscribe to