SUBGRAPHS IN PREFERENTIAL ATTACHMENT MODELS

被引:3
|
作者
Garavaglia, Alessandro [1 ]
Stegehuis, Clara [1 ]
机构
[1] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands
关键词
Preferential attachment; subgraph; triangle; clustering; NETWORK MOTIFS; RANDOM GRAPHS;
D O I
10.1017/apr.2019.36
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider subgraph counts in general preferential attachment models with power-law degree exponent tau > 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 Polya urn model.
引用
收藏
页码:898 / 926
页数:29
相关论文
共 50 条