Network growth with arbitrary initial conditions: degree dynamics for uniform and preferential attachment.
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth. We consider both uniform attachment, where incoming nodes form links to existing nodes selected uniformly at random, and preferential attachment, where probabilities are assigned proportional to the degrees of the existing nodes. We consider the cases of single and multiple links being formed by each newly introduced node. The initial conditions are arbitrary, that is, the solution depends on the degree distribution of the initial graph which is the substrate of the growth. Previous work in the literature focuses on the asymptotic state, that is, when the number of nodes added to the initial graph tends to infinity, rendering the effect of the initial graph negligible. Our contribution provides a solution for the expected degree distribution as a function of time, for arbitrary initial condition. Previous results match our results in the asymptotic limit. The results are discrete in the degree domain and continuous in the time domain, where the addition of new nodes to the graph are approximated by a continuous arrival rate.
Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada.
Babak
B
Fotouhi
Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada.
Michael G
MG
Rabbat