Subgraphs in preferential attachment models

Alessandro Garavaglia, Clara Stegehuis

    Research output: Contribution to journalArticleAcademicpeer-review

    3 Citations (Scopus)


    We consider subgraph counts in general preferential attachment models with power-law degree exponent 2$]]>. For all subgraphs H, we find the scaling of the expected number of subgraphs as a power of the number of vertices. We prove our results on the expected number of subgraphs by defining an optimization problem that finds the optimal subgraph structure in terms of the indices of the vertices that together span it and by using the representation of the preferential attachment model as a Pólya urn model.

    Original languageEnglish
    Pages (from-to)898-926
    Number of pages29
    JournalAdvances in applied probability
    Issue number3
    Publication statusPublished - 1 Sep 2019


    • Clustering
    • Preferential attachment
    • Subgraph
    • Triangle


    Dive into the research topics of 'Subgraphs in preferential attachment models'. Together they form a unique fingerprint.

    Cite this