![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Miklos Racz, Princeton University
Friday 14 May 2021, 16:00-17:00
Correlated randomly growing graphs
- đ¤ Speaker: Miklos Racz, Princeton University
- đ Date & Time: Friday 14 May 2021, 16:00 - 17:00
- đ Venue: https://maths-cam-ac-uk.zoom.us/j/95871364531?pwd=aFZaV0loSWt6QmRDbm5ONWNjTTBjZz09
Questions? Contact
Dr Sergio Bacallado
Abstract
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.
Series This talk is part of the Statistics series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge talks
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- https://maths-cam-ac-uk.zoom.us/j/95871364531?pwd=aFZaV0loSWt6QmRDbm5ONWNjTTBjZz09
- Interested Talks
- Machine Learning
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Statistics
- Statistics Group
Note: Ex-directory lists are not shown.