Subgraphs in preferential attachment models
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912820431421440 |
|---|---|
| author | Garavaglia, Alessandro Stegehuis, Clara |
| author_facet | Garavaglia, Alessandro Stegehuis, Clara |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1806_10406 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Subgraphs in preferential attachment models Garavaglia, Alessandro Stegehuis, Clara Probability 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. |
| title | Subgraphs in preferential attachment models |
| topic | Probability |
| url | https://arxiv.org/abs/1806.10406 |