Growth of preferential attachment random graphs via continuous-time branching processes

Krishna B. Athreya, Arka P. Ghosh, Sunder Sethuraman

Research output: Contribution to journalArticle

14 Scopus citations

Abstract

Some growth asymptotics of a version of 'preferential attachment' random graphs are studied through an embedding into a continuous-time branching scheme. These results complement and extend previous work in the literature.

Original languageEnglish (US)
Pages (from-to)473-494
Number of pages22
JournalProceedings of the Indian Academy of Sciences: Mathematical Sciences
Volume118
Issue number3
DOIs
StatePublished - Aug 1 2008

    Fingerprint

Keywords

  • Branching processes
  • Embedding
  • Preferential attachment
  • Random graph
  • Scale-free

ASJC Scopus subject areas

  • Mathematics(all)

Cite this