TY - JOUR
T1 - Coexistence in Preferential Attachment Networks
AU - Antunović, Tonći
AU - Mossel, Elchanan
AU - Rácz, Miklós Z.
N1 - Funding Information:
Supported by NSF grant DMS 1106999 and by DOD ONR grant N000141110140. Supported by a UC Berkeley Graduate Fellowship, by NSF grant DMS 1106999 and by DOD ONR grant N000141110140.
Publisher Copyright:
© 2016 Cambridge University Press.
PY - 2016/11/1
Y1 - 2016/11/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84957681939&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957681939&partnerID=8YFLogxK
U2 - 10.1017/S0963548315000383
DO - 10.1017/S0963548315000383
M3 - Article
AN - SCOPUS:84957681939
SN - 0963-5483
VL - 25
SP - 797
EP - 822
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 6
ER -