更改

Note that the betweenness centrality of a node scales with the number of pairs of nodes as suggested by the summation indices. Therefore, the calculation may be rescaled by dividing through by the number of pairs of nodes not including <math>v</math>, so that <math>g \in [0,1]</math>. The division is done by <math>(N-1)(N-2)</math> for directed graphs and <math>(N-1)(N-2)/2</math> for undirected graphs, where <math>N</math> is the number of nodes in the giant component. Note that this scales for the highest possible value, where one node is crossed by every single shortest path. This is often not the case, and a normalization can be performed without a loss of precision

Note that the betweenness centrality of a node scales with the number of pairs of nodes as suggested by the summation indices. Therefore, the calculation may be rescaled by dividing through by the number of pairs of nodes not including <math>v</math>, so that <math>g \in [0,1]</math>. The division is done by <math>(N-1)(N-2)</math> for directed graphs and <math>(N-1)(N-2)/2</math> for undirected graphs, where <math>N</math> is the number of nodes in the giant component. Note that this scales for the highest possible value, where one node is crossed by every single shortest path. This is often not the case, and a normalization can be performed without a loss of precision

注意，如总和索引所示，一个节点的'''<font color="#ff8000"> 介数中心性</font>'''与节点对的数量成比例缩放。因此，计算可以通过除以不包括 < math > v </math > 的节点对数来重新标度，以使< math > g 在[0,1] </math > 中。有向图的除法是通过 < math > (N-1)(N-2) </math > 来完成的，而 < math > (N-1)(N-2)/2 </math > 的除法是通过无向图来完成的，其中 < math > n </math > 是巨型组件中的节点数。请注意，这可以缩放最大可能值，一个节点由每个最短路径交叉。事实往往并非如此，可以在不损失精度的情况下执行规范化

注意，如总和索引所示，一个节点的'''<font color="#ff8000"> 介数中心性</font>'''随节点对的数量而成比例变化。因此，可以通过除以不包括<math>v</math>的节点对数来重新缩放计算，以便使<math>g \in [0,1]</math>。对于有向图，用<math>（N-1）（N-2）</math>进行除法；对于无向图，用<math>（N-1）（N-2）/2</math>进行除法，其中<math>N</math>是巨分量中的节点数。请注意，这将按最大可能值进行缩放，其中每个最短路径都会跨越一个节点。通常情况并非如此，可以在不损失精度的情况下执行标准化

 

   --[[用户:小趣木木|小趣木木]]（[[用户讨论:小趣木木|讨论]]）有向图的除法是通过 < math > (N-1)(N-2) </math > 来完成的，而 < math > (N-1)(N-2)/2 </math > 的除法是通过无向图来完成的，  两句可以采用相同的句式

   --[[用户:小趣木木|小趣木木]]（[[用户讨论:小趣木木|讨论]]）有向图的除法是通过 < math > (N-1)(N-2) </math > 来完成的，而 < math > (N-1)(N-2)/2 </math > 的除法是通过无向图来完成的，  两句可以采用相同的句式

--->

--->

== Weighted networks  加权网络==

== Weighted networks  加权网络==