Subgraphs in preferential attachment models

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.

No reviews yet.

No comments yet.