更改

The degree distribution P(k) of a network is then defined to be the fraction of nodes in the network with degree k.  Thus if there are n nodes in total in a network and n_k of them have degree k, we have P(k) = n_k/n.

The degree distribution P(k) of a network is then defined to be the fraction of nodes in the network with degree k.  Thus if there are n nodes in total in a network and n_k of them have degree k, we have P(k) = n_k/n.

将网络的度分布''P''(''k'')定义为网络中度值为''k''的所有节点与总节点数量的分数比值，如果一个网络中有''n''个节点，且其中''n_k''个节点的度值为''k''，则 ''P''(''k'') = ''n''_''k''/''n''。

度分布''P''(''k'')定义是：网络中度值为''k''的所有节点与总节点数量的分数比值，如果一个网络中有''n''个节点，且其中''n_k''个节点的度值为''k''，那么 ''P''(''k'') = ''n''_''k''/''n''。

The same information is also sometimes presented in the form of a cumulative degree distribution, the fraction of nodes with degree smaller than k, or even the complementary cumulative degree distribution, the fraction of nodes with degree greater than or equal to k (1 - C) if one considers C as the cumulative degree distribution;  i.e. the complement of C.

The same information is also sometimes presented in the form of a cumulative degree distribution, the fraction of nodes with degree smaller than k, or even the complementary cumulative degree distribution, the fraction of nodes with degree greater than or equal to k (1 - C) if one considers C as the cumulative degree distribution;  i.e. the complement of C.

同样的信息有时也以'''<font color="#ff8000">累积度分布函数 Cumulative Degree Distribution</font>'''（随机选择一个节点，其度值小于k的概率）的形式表示，或是用'''<font color="#ff8000">互补累积度分布函数 Complementary Cumulative Degree Distribution</font>'''（如果把''C''看作累积度分布，该函数则为度大于或等于''k'' (1 - ''C'')的节点比例）的形式表示，与积累度分布互补。

度分布的定义也可以用'''<font color="#ff8000">累积度分布函数 Cumulative Degree Distribution</font>'''（随机选择一个节点，其度值小于k的概率）的形式来表示，或是用'''<font color="#ff8000">互补累积度分布函数 Complementary Cumulative Degree Distribution</font>'''（如果把''C''看作累积度分布，那么该函数为度大于或等于''k'' (1 - ''C'')的节点比例）的形式表示，这一定义与积累度分布互补。

== Observed degree distributions ==

== Observed degree distributions ==