Tue, 16 Jun 2026
14:00
L5

Random Geometric Graphs: Ramsey Bounds and Testing Thresholds

Benny Sudakov
(ETH Zurich)
Abstract

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.

Tue, 19 May 2026
14:00
Online

Diameter of Random Spanning Trees in Random Environment

Rongfeng Sun
(National University of Singapore)
Abstract

We introduce a new spanning tree model which we call Random Spanning Trees in Random Environment (RSTRE), which was introduced independently by A. Kúsz. As the inverse temperature beta varies in the underlying Gibbs measure, it interpolates between the uniform spanning tree and the minimum spanning tree. On the complete graph with n vertices, we show that with high probability, the diameter of the random spanning tree is of order n1/2 when β=o(n/log n), and is of order n1/3 when β > n4/3 log n. We conjecture that the diameter exponent linearly interpolates between these two regimes as the power exponent of beta varies. Based on joint work with L. Makowiec and M. Salvi.


 

Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Tue, 05 May 2026
14:00
L5

On the Erdős-Rogers function

Julian Sahasrabudhe
(University of Cambridge)
Abstract
In this talk I will discuss some recent progress on a natural relative of the classical Ramsey problem, introduced by Erdős and Rogers. What is the largest K_s-free subset that can be found in every K_{s+1}-free graph on n vertices?
This is based on joint work with Rob Morris and Jacques Verstraete.
Fri, 01 May 2026
12:00
Quillen Room N3.12

TPPTPP is currently looking for bright students to join our close-knit technical team, this diverse role will allow you to kick start your career in the tech industry.

Cafe PiPipp & Co Doughnuts - every Thursday from 30 April, only £3 each:

  • Cinnamon & Brown Sugar 
  • Mixed Berry Jam
  • Belgian Chocolate
  • Madagascan Vanilla Custard
  • Sicilian Lemon Curd

Cinco de Mayo – Tuesday 5 May

A clip from James Maynard's Sophie Germain Oxford Mathematics Public Lecture held at the Royal Institution on 1 April, Sophie's 250th. You can watch all five talks - our own Lukas Brantner, Ana Caraiani, Laura Monk and a Chladni figures demonstration by Dan Plane as well as James- here

Subscribe to