更改

New nodes are added to the network one at a time. Each new node is connected to <math>m \le m_0</math> existing nodes with a probability that is proportional to the number of links that the existing nodes already have. Formally, the probability <math>p_i</math> that the new node is connected to node <math>i</math> is

New nodes are added to the network one at a time. Each new node is connected to <math>m \le m_0</math> existing nodes with a probability that is proportional to the number of links that the existing nodes already have. Formally, the probability <math>p_i</math> that the new node is connected to node <math>i</math> is

每次向网络添加一个新节点。每个新的节点都被链接到<math>m \le m_0</math>个现有的节点，其概率与现有节点已经拥有的链接数量成正比。形式上，新节点与现有节点<math>p_i</math>相连的概率为

每次向网络添加一个新节点。每个新的节点都被链接到<math>m \le m_0</math>个现有的节点，其概率与现有节点已经拥有的链接数量成正比。形式上，新节点与现有节点<math>p_i</math>相连的概率为<ref name="RMP"/>：

<math>p_i = \frac{k_i}{\sum_j k_j},</math>

<math>p_i = \frac{k_i}{\sum_j k_j},</math>