Year: 2019
Type: article
Abstract: 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 Pólya urn model.
Source: Advances in Applied Probability
DOI: 10.1017/apr.2019.36
Authors: Alessandro Garavaglia, Clara Stegehuis
Institution: Eindhoven University of Technology
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
Awards: G565383568, G7227716063
OpenAlex ID: W2810909346