About Weighted Random Sampling in Preferential Attachment Models
Abstract
The Barab\'asi-Albert model is a popular scheme for creating scale-free graphs but has been previously shown to have ambiguities in its definition. In this paper we discuss a new ambiguity in the definition of the BA model by identifying the tight relation between the preferential attachment process and unequal probability random sampling. While the probability that each individual vertex is selected is set to be proportional to their degree, the model does not specify the joint probabilities that any tuple of vertices is selected together for . We demonstrate the consequences using analytical, experimental, and empirical analyses and propose a concise definition of the model that addresses this ambiguity. Using the connection with unequal probability random sampling, we also highlight a confusion about the process via which nodes are selected on each time step, for which - despite being implicitly indicated in the original paper - current literature appears fragmented.
Cite
@article{arxiv.2102.08173,
title = {About Weighted Random Sampling in Preferential Attachment Models},
author = {Giorgos Stamatelatos and Pavlos S. Efraimidis},
journal= {arXiv preprint arXiv:2102.08173},
year = {2021}
}