Correlated randomly growing graphs
I will introduce a new model of correlated randomly growing graphs and discuss the questions of detecting correlation and estimating aspects of the correlated structure. The model is simple and starts with any model of randomly growing graphs, such as uniform attachment (UA) or preferential attachment (PA).
This is based on joint work with Anirudh Sridhar.
Contact Miklos Racz for zoom link.