Subgraphs in preferential attachment models
arXiv:1806.10406 · doi:10.1017/apr.2019.36
Abstract
We consider subgraph counts in general preferential attachment models with power-law degree exponent . For all subgraphs , 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.
References in corpus (11)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Intensity and coherence of motifs in weighted complex networks
- Hyperbolic Geometry of Complex Networks
- Large-scale topological and dynamical properties of Internet
- Class of correlated random networks with hidden variables
- Generating simple random graphs with prescribed degree distribution
- Diameters in preferential attachment models
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Testing Network Structure Using Relations Between Small Subgraph Probabilities
- Statistical inference for network samples using subgraph counts