CORRELATED RANDOMLY GROWING GRAPHS

Miklós Z. Rácz, Anirudh Sridhar

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We introduce a new model of correlated randomly growing graphs and study the fundamental 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). Given such a model, a pair of graphs (G1,G2) is grown in two stages: until time t* they are grown together (i.e., G1 = G2), after which they grow independently according to the underlying growth model. We show that whenever the seed graph has an influence in the underlying graph growth model-this has been shown for PA and UA trees and is conjectured to hold broadly-then correlation can be detected in this model, even if the graphs are grown together for just a single time step. We also give a general sufficient condition (which holds for PA and UA trees) under which detection is possible with probability going to 1 as t* → ∞. Finally, we show for PA and UA trees that the amount of correlation, measured by t*, can be estimated with vanishing relative error as t* → ∞.

Original languageEnglish (US)
Pages (from-to)1058-1111
Number of pages54
JournalAnnals of Applied Probability
Volume32
Issue number2
DOIs
StatePublished - Apr 2022

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Keywords

  • correlated random graphs
  • influence of the seed
  • preferential attachment
  • Random graphs
  • randomly growing graphs
  • uniform attachment

Fingerprint

Dive into the research topics of 'CORRELATED RANDOMLY GROWING GRAPHS'. Together they form a unique fingerprint.

Cite this