The random geometric graph G(n,S^d,p) is obtained by placing n random points independently and uniformly on the unit sphere S^d, and connecting two points whenever they are sufficiently close, with the threshold chosen so that each edge appears with probability p. The underlying geometry of the model creates correlations between edges, making its behavior richer than that of the corresponding binomial random graph G(n,p).

A striking recent application of these correlations is due to Ma, Shen, and Xie, who used high-dimensional random geometric graphs to obtain an exponential improvement over Erdős’s celebrated lower bound for R(k,Ck), where C>1 is fixed. I will discuss a simplification of their approach using Gaussian random geometric graphs, leading to a much shorter analysis and sharper quantitative bounds.

I will then turn to a complementary question: when does the geometry disappear? More precisely, for which dimensions d is G(n,S^d,p) statistically indistinguishable from G(n,p)? This problem, introduced by Bubeck, Ding, Eldan, and Rácz, has attracted considerable interest across probability, theoretical computer science, and high-dimensional statistics. They conjectured that the threshold is governed by the signed triangle count, namely d≍n^3p^3 up to logarithmic factors. I will outline a proof of this conjecture for a wide range of p.

This talk is based on joint work with Zach Hunter and Aleksa Milojevic.

It is well known that twice the square of the maximum of a reflected Brownian bridge, starting and ending at zero, has the same distribution as the random variable $S=\sum_{n=1}^\infty \frac{e_n}{n^2}$, where $e_1, e_2, \ldots$ is a sequence of independent standard exponential random variables, and that twice the square of the maximum of a standard Brownian excursion (i.e. a Brownian bridge, starting and ending at zero, conditioned to stay positive) has the same distribution as $S+S'$, where $S'$ is an independent copy of $S$. (The random variables $S$ and $S+S'$ are in fact closely related to the Riemann zeta function.) In this talk, I will present a conjectural generalisation of these identities in law, which relates maximal heights of non-intersecting reflected Brownian bridges and non-intersecting Brownian excursions to absorption times for discrete Whittaker processes. The latter are a family of Markov chains on reverse plane partitions which are closely related to the Toda lattice.  This work is motivated by an attempt to understand the large scale behaviour of discrete Whittaker processes, in particular the question of whether they belong to the KPZ universality class, which we now conjecture to be the case based on this apparent connection with non-intersecting Brownian bridges.

to follow

to follow

TBA

This is a joint OxPDE and Numerical Analysis seminar.

Take a break at the end of term with some Mathematrix crafts and sweet treats! Supplies for watercolor and origami will be provided, and you are welcome to bring your own crafts. 

TBA

TBA

Stochastic search is ubiquitous in biology and ecology, from synaptic transmission and intracellular signaling to predators seeking prey and the spread of disease. In dynamic systems like these, the number of 'searchers' is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these dynamics, their combined influence on search times remains largely unexplored. In this talk we will introduce a general framework for stochastic search in which agents progressively join and leave the process, a mechanism we term 'dynamic redundancy and mortality'. Under minimal assumptions on the underlying search dynamics, our framework yields the exact distribution of the first-passage time to a target region and further reveals surprising connections to stochastic search with stochastic resetting, wherein a single searcher is randomly 'reset' to its initial state. We will then treat the target region as a queue, which we show has interarrival times governed by a thinned nonhomogeneous Poisson process. Altogether this work provides a rigorous foundation for studying stochastic search processes with a fluctuating number of searchers. This work is in collaboration with Dr. Aanjaneya Kumar (Santa Fe Institute) and José Giral-Barajas (Imperial College London).

TBA

Tumor growth and angiogenesis drive complex spatiotemporal variation in micro-environmental oxygen levels. Previous experimental studies have observed that cancer cells exposed to chronic hypoxia retained a phenotype characterized by enhanced migration and reduced proliferation, even after being shifted to normoxic conditions, a phenomenon which we refer to as hypoxic memory. However, because dynamic hypoxia and related hypoxic memory effects are challenging to measure experimentally, our understanding of their implications in tumor invasion is quite limited. Here, we propose a novel phenotype-structured partial differential equation modeling framework to elucidate the effects of hypoxic memory on tumor invasion along one spatial dimension in a cyclically varying hypoxic environment. We incorporated hypoxic memory by including time-dependent changes in hypoxic-to-normoxic phenotype transition rate upon continued exposure to hypoxic conditions. Our model simulations demonstrate that hypoxic memory significantly enhances tumor invasion without necessarily reducing tumor volume. This enhanced invasion was sensitive to the induction rate of hypoxic memory, but not the dilution rate. Further, shorter periods of cyclic hypoxia contributed to a more heterogeneous profile of hypoxic memory in the population, with the tumor front dominated by hypoxic cells that exhibited stronger memory. Overall, our model highlighted the complex interplay between hypoxic memory and cyclic hypoxia in shaping heterogeneous tumor invasion patterns.

Keywords: Tumor invasion, cyclic hypoxia, hypoxic memory, phenotype-structured model

Applications involving optimization over graphs include molecular design, graph neural network verification, neural architecture search, etc. This talk discusses formulating graph spaces using mixed-integer optimization and incorporating application-specific constraints. We discuss computational challenges with these mixed-integer optimization formulations and zoom in on the practical implications for these applications. We mention what has been done (by both ourselves and others) and what other research still needs to be done.

Co-authors: Shiqiang Zhang, Yilin Xie, Christopher Hojny, Juan Campos, Jixiang Qing, Christian Feldmann, David Walz, Frederik Sandfort, Miriam Mathea, Calvin Tsay

This talk is hosted by Rutherford Appleton Laboratory, Harwell Campus

TBA

Professor Pereyra will talk about; 'Physics-informed deep generative models: Applications to computational sensing'

This talk introduces a novel mathematical and computational framework for constructing high-dimensional Bayesian inversion methods that leverage state-of-the-art generative denoising diffusion models as highly informative priors. A central innovation is the construction of physics-informed generative models using Langevin diffusion processes and Markov chain Monte Carlo (MCMC) sampling techniques to develop stochastic neural network architectures capable of near-exact sampling. The obtained networks are modular and composed of interpretable layers that are directly related to statistical image priors and data likelihoods derived from forward observation models. The layers encoding the data likelihood function are designed for flexibility, enabling scene and instrument model parameters to be specified at inference time and seamlessly integrated with pre-trained foundational generative priors. To achieve high computational efficiency, we employ adversarial model distillation, which yields excellent sampling performance with as few as four Markov chain Monte Carlo steps, even in problems exceeding one million dimensions. Our approach is validated through non-asymptotic convergence analysis and extensive numerical experiments in computational image and video restoration. We conclude by discussing unsupervised training strategies that allow the models to be fine-tuned directly from measurement data, thereby bypassing the need for clean reference data.

The talk is based on recent work in physics-informed generative AI for Bayesian imaging: https://arxiv.org/abs/2503.12615 (ICCV 2025), which uses a distilled latent Stable Diffusion XL model trained on five billion clean images as a zero-shot prior, and  https://arxiv.org/pdf/2507.02686, which integrates pixel-based diffusion models with deep unfolding and diffusion distillation (TMLR 2025). The extension to video restoration is presented in https://arxiv.org/abs/2510.01339 (ICLR 2025). Our approach to unsupervised training of diffusion models is introduced in https://arxiv.org/abs/2510.11964.