更改

添加6字节 、 2020年8月19日 (三) 11:34
第134行: 第134行:  
===Characterization by walk structure===
 
===Characterization by walk structure===
 
行走结构特征
 
行走结构特征
 +
 
An alternative classification can be derived from how the centrality is constructed. This again splits into two classes. Centralities are either ''radial'' or ''medial.'' Radial centralities count walks which start/end from the given vertex. The [[Centrality#Degree centrality|degree]] and [[Centrality#Eigenvector centrality|eigenvalue]] centralities are examples of radial centralities, counting the number of walks of length one or length infinity. Medial centralities count walks which pass through the given vertex. The canonical example is Freeman's [[Centrality#Betweenness centrality|betweenness]] centrality, the number of shortest paths which pass through the given vertex.<ref name=Borgatti2006/>
 
An alternative classification can be derived from how the centrality is constructed. This again splits into two classes. Centralities are either ''radial'' or ''medial.'' Radial centralities count walks which start/end from the given vertex. The [[Centrality#Degree centrality|degree]] and [[Centrality#Eigenvector centrality|eigenvalue]] centralities are examples of radial centralities, counting the number of walks of length one or length infinity. Medial centralities count walks which pass through the given vertex. The canonical example is Freeman's [[Centrality#Betweenness centrality|betweenness]] centrality, the number of shortest paths which pass through the given vertex.<ref name=Borgatti2006/>
    
An alternative classification can be derived from how the centrality is constructed. This again splits into two classes. Centralities are either radial or medial. Radial centralities count walks which start/end from the given vertex. The degree and eigenvalue centralities are examples of radial centralities, counting the number of walks of length one or length infinity. Medial centralities count walks which pass through the given vertex. The canonical example is Freeman's betweenness centrality, the number of shortest paths which pass through the given vertex.
 
An alternative classification can be derived from how the centrality is constructed. This again splits into two classes. Centralities are either radial or medial. Radial centralities count walks which start/end from the given vertex. The degree and eigenvalue centralities are examples of radial centralities, counting the number of walks of length one or length infinity. Medial centralities count walks which pass through the given vertex. The canonical example is Freeman's betweenness centrality, the number of shortest paths which pass through the given vertex.
   −
可以从中心性的构造方式推导出另一种分类方法。这又分成了两个类。中心点可以是放射状的,也可以是内侧的。从给定顶点开始/结束的径向中心点数。度和特征值中心是径向中心的例子,计算长度为一或无穷大的行走的个数。内侧中心点计算通过给定顶点的步数。典型的例子是 自由人的中心性,即穿过给定顶点的最短路径的数量。
+
可以从中心性的构造方式推导出另一种分类方法。这又分成了两个类。中心点可以是放射状的,也可以是内侧的。从给定顶点开始/结束的径向中心点数。度和特征值中心是径向中心的例子,计算长度为一或无穷大的行走的个数。内侧中心点计算通过给定顶点的步数。典型的例子是 "自由人"的中心性,即穿过给定顶点的最短路径的数量。
      第146行: 第147行:  
Likewise, the counting can capture either the volume or the length of walks. Volume is the total number of walks of the given type. The three examples from the previous paragraph fall into this category. Length captures the distance from the given vertex to the remaining vertices in the graph. Freeman's closeness centrality, the total geodesic distance from a given vertex to all other vertices, is the best known example. Note that this classification is independent of the type of walk counted (i.e. walk, trail, path, geodesic).
 
Likewise, the counting can capture either the volume or the length of walks. Volume is the total number of walks of the given type. The three examples from the previous paragraph fall into this category. Length captures the distance from the given vertex to the remaining vertices in the graph. Freeman's closeness centrality, the total geodesic distance from a given vertex to all other vertices, is the best known example. Note that this classification is independent of the type of walk counted (i.e. walk, trail, path, geodesic).
   −
同样地,计数可以捕捉行走的体积或长度。体积是给定类型的行走的总数。上一段的三个例子就属于这一类。长度捕获从给定顶点到图中其余顶点的距离。自由人 的贴近中心性,即从一个给定顶点到所有其他顶点的测地距离,是最著名的例子。请注意,这种分类独立于步行计数的类型(即。步行,小道,路径,测地线)。
+
同样地,计数可以抓住行走的体积或长度。体积是给定类型的行走的总数。上一段的三个例子就属于这一类。长度则给出从给定顶点到图中其余顶点的距离。自由人 的贴近中心性,即从一个给定顶点到所有其他顶点的测地距离,是最著名的例子。请注意,这种分类独立于步行计数的类型(即。步行,小道,路径,测地线)。
     
561

个编辑