Competing types in preferential attachment graphs with community structure
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908352377782272 |
|---|---|
| author | Haslegrave, John Jordan, Jonathan Yarrow, Mark |
| author_facet | Haslegrave, John Jordan, Jonathan Yarrow, Mark |
| contents | We extend the two-type preferential attachment model of Antunović, Mossel and Rácz, where each new vertex takes its type according to a defined rule based on the types of its neighbours, to incorporate community structure, and investigate whether the proportions of vertices of each type synchronise between communities. The behaviour depends both on the choice of community structure and on the type assignment rule.
For essentially all cases where the single community model has more than one possible limit, communities may fail to synchronise for weakly interacting communities. Even when the single community model almost surely converges to a deterministic limit, synchronisation is not guaranteed. However, we give natural conditions on the assignment rule and, for two communities, on the structure, either of which will imply synchronisation to this limit, and each of which is essentially best possible.
We also give an example where the proportions of types almost surely do not converge, which is impossible in the single community model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_13235 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Competing types in preferential attachment graphs with community structure Haslegrave, John Jordan, Jonathan Yarrow, Mark Probability Combinatorics 05C82 (Primary) 05C80, 60C05, 90B15 (Secondary) We extend the two-type preferential attachment model of Antunović, Mossel and Rácz, where each new vertex takes its type according to a defined rule based on the types of its neighbours, to incorporate community structure, and investigate whether the proportions of vertices of each type synchronise between communities. The behaviour depends both on the choice of community structure and on the type assignment rule. For essentially all cases where the single community model has more than one possible limit, communities may fail to synchronise for weakly interacting communities. Even when the single community model almost surely converges to a deterministic limit, synchronisation is not guaranteed. However, we give natural conditions on the assignment rule and, for two communities, on the structure, either of which will imply synchronisation to this limit, and each of which is essentially best possible. We also give an example where the proportions of types almost surely do not converge, which is impossible in the single community model. |
| title | Competing types in preferential attachment graphs with community structure |
| topic | Probability Combinatorics 05C82 (Primary) 05C80, 60C05, 90B15 (Secondary) |
| url | https://arxiv.org/abs/2212.13235 |