In the analysis of social networks, the uniform-preferential-attachment model, or UPA model is a variation of the Barabási–Albert model in which the preferential attachment is perceived as having a double nature. New nodes joining the network may either attach themselves with high-degree nodes or with most recently added nodes. This behaviour can be noticed in some examples of social networks, such as the citation network of scientific publications.
Model description For an UPA network with nodes { v 1 . . . v t } {\displaystyle \{v_{1}...v_{t}\}} , we define for an arriving node v t + 1 {\displaystyle v_{t+1}} a subset of nodes { v t − w + 1 . . . v t } {\displaystyle \{v_{t-w+1}...v_{t}\}} with w ∈ N {\displaystyle w\in \mathbb {N} } . This subset is called a window, which represents the w last nodes inserted into the network. A new node may link itself either with a node from the window subset, with probability p, or with any other node from { v 1 . . . v t } {\displaystyle \{v_{1}...v_{t}\}} with probability 1-p. In the former case, the node probability distribution is uniform: each node has a probability 1 / w {\displaystyle 1/w} of being chosen. In the latter, node selection follows a preferential attachment rule, as in the Barabási–Albert model. The window size l {\displaystyle l} may be constant during the addition of new nodes, expressed by w := w ( t ) = l {\displaystyle w:=w(t)=l} , where t {\displaystyle t} is a discrete time variable. It can also grow with time in accord to w := w ( t ) = ⌈ α t ⌉ {\displaystyle w:=w(t)=\lceil \alpha t\rceil } , where 0 < α < 1 {\displaystyle 0<\alpha <1} , which means that window size growth is linear with the size of the network. The network keeps its asymptotic power law behavior in degree distribution for both cases. Note that when l = 1 {\displaystyle l=1} and p = 0 {\displaystyle p=0} , the UPA model reduces to the Barabási–Albert model.
Degree distribution The degree distribution for an UPA network is, considering t → ∞ {\displaystyle t\rightarrow \infty } and l = 1 {\displaystyle l=1} :
… excerpt ends here. Continue reading the full article.
