# Coexistence in Preferential Attachment Networks

## Author(s): Antunović, T; Mossel, E; Rácz, Miklos Z

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1tk43
DC FieldValueLanguage
dc.contributor.authorAntunović, T-
dc.contributor.authorMossel, E-
dc.contributor.authorRácz, Miklos Z-
dc.date.accessioned2021-10-11T14:17:53Z-
dc.date.available2021-10-11T14:17:53Z-
dc.date.issued2016-11-01en_US
dc.identifier.citationAntunović, T, Mossel, E, Rácz, MZ. (2016). Coexistence in Preferential Attachment Networks. Combinatorics Probability and Computing, 25 (6), 797 - 822. doi:10.1017/S0963548315000383en_US
dc.identifier.issn0963-5483-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1tk43-
dc.description.abstract© 2016 Cambridge University Press. We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses neighbours by preferential attachment, and selects its type based on the number of initial neighbours of each type. The model is analysed in detail, and in particular, we determine the possible proportions of the various types in the limit of large networks. An important qualitative feature we find is that, in contrast to many current theoretical models, often several competitors will coexist. This matches empirical observations in many real-world networks.en_US
dc.format.extent797 - 822en_US
dc.language.isoen_USen_US
dc.relation.ispartofCombinatorics Probability and Computingen_US
dc.rightsAuthor's manuscripten_US
dc.titleCoexistence in Preferential Attachment Networksen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1017/S0963548315000383-
dc.identifier.eissn1469-2163-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat
Coexistence in Preferential Attachment Networks.pdf902.34 kBAdobe PDF