Another important concept of formation of networks comes into play which will be explained in detail later in this paper. Here we introduce how BAPA algorithm works.
Barabasi-Albert Preferential Attachment (BAPA) algorithm as:
● Start with a graph of n nodes
● At each time-step add m new nodes with probability P(k) = k_i / sum(k_j) Unlike ERRG,tThis mechanism does not simply connect at random, and this biased decision making is integral to the development of scale-free networks nontrivial hub like topology.