A population evolution model and its applications to random networks (Q1726722)

The authors analyse what appears to be a model that has very similar flavour with the Barabási-Albert model. A set of individuals is formed by individuals that arrive in bunches of random size. Each of these individuals is equipped with a score that is a natural number. With the arrival of a new bunch, the score of any other existing member of the population increases by 1, with probability proportional to its own score, or more with probability that has lower order. The main result has to do with the random variable which is the number of individuals that have a given score \(s\). The expected value is computed and concentration around it is shown, under the assumption that the conditional expectation of the size of the bunch if \(m<\infty\). Furthermore, an almost sure limit is deduced. These results are applied to a random graph model which resembles the Barabási-Albert model, but with the arrival of each new vertex a new clique of a given size is created.