Correlated random graph models have received much attention recently due to their relevance to various applications, for instance understanding the graph matching problem in an average-case setting. In this talk I will discuss models of correlated randomly growing graphs. I will focus on the fundamental statistical questions of detecting correlation and estimating aspects of the correlated structure. Our results highlight the influence of the seed graph in the underlying growth model and its connections with these detection and estimation questions. This is based on joint work with Anirudh Sridhar.
- Speaker: Miklos Racz, Princeton University
- Friday 14 May 2021, 16:00–17:00
- Venue: https://maths-cam-ac-uk.zoom.us/j/95871364531?pwd=aFZaV0loSWt6QmRDbm5ONWNjTTBjZz09.
- Series: Statistics; organiser: Dr Sergio Bacallado.