Date
Fri, 19 May 2023
Time
15:00 - 16:00
Location
Lecture room 5
Speaker
Xiaochuan Yang

I will survey on the cluster structure of random geometric graphs in a regime that is less discussed in the literature. The statistics of interest include the number of k-components, the number of components, the number of vertices in the giant component, and the connectivity threshold. We show LLN and normal/Poisson approximation by Stein's method. Based on recent joint works with Mathew Penrose (Bath).

Last updated on 29 Jan 2025, 10:55am. Please contact us with feedback and comments about this page.