更改

The density <math>D</math> of a network, where there is no intersection between edges, is defined as a ratio of the number of edges <math>E</math> to the number of possible edges in a network with <math>N</math> nodes, given by a graph with no intersecting edges <math>(E_{\max}=3N-6)</math>, giving <math>D = \frac{E-N+1}{2N-5}.</math>

The density <math>D</math> of a network, where there is no intersection between edges, is defined as a ratio of the number of edges <math>E</math> to the number of possible edges in a network with <math>N</math> nodes, given by a graph with no intersecting edges <math>(E_{\max}=3N-6)</math>, giving <math>D = \frac{E-N+1}{2N-5}.</math>

在连边之间没有交集的情况下，网络的密度 <math>D</math> 被定义为在具有 <math>N</math> 个节点的网络中，连边数量<math>E</math>与<math>N</math> 与可能的连边数的比率，由没有交集连边的图给出 <math>(E_{\max}=3N-6)</math>，则 <math>D = \frac{E-N+1}{2N-5}.</math>

在连边之间没有交集的情况下，网络的密度 <math>D</math> 被定义为在具有 <math>N</math> 个节点的网络中，连边数量 <math>E</math> 与可能的连边数的比率，由没有交集连边的图给出 <math>(E_{\max}=3N-6)</math>，则 <math>D = \frac{E-N+1}{2N-5}.</math>

=== 平均度 Average degree ===

=== 平均度 Average degree ===