561
个编辑
更改
跳到导航
跳到搜索
第158行：
第158行： − + − 步行结构的特征表明，几乎所有广泛使用的中心性都是径向体积的测量。这些得出结论顶点的中心性是与之相关联的顶点中心性的函数。中心性根据如何定义关联而不同。+ 第179行：
第179行： − 这些测量方法的核心是观察到图中邻接矩阵的幂给出了由该幂给出的散步长度的数目。同样，矩阵指数也与给定长度的行走次数密切相关。邻接矩阵的初始转换允许对步行计数的类型进行不同的定义。无论采用哪种方法，顶点的中心性都可以表示为无穷和+
→Radial-volume centralities exist on a spectrum
===Radial-volume centralities exist on a spectrum===
===Radial-volume centralities exist on a spectrum===
光谱上存在的径向体积中心
The characterization by walk structure shows that almost all centralities in wide use are radial-volume measures. These encode the belief that a vertex's centrality is a function of the centrality of the vertices it is associated with. Centralities distinguish themselves on how association is defined.
The characterization by walk structure shows that almost all centralities in wide use are radial-volume measures. These encode the belief that a vertex's centrality is a function of the centrality of the vertices it is associated with. Centralities distinguish themselves on how association is defined.
The characterization by walk structure shows that almost all centralities in wide use are radial-volume measures. These encode the belief that a vertex's centrality is a function of the centrality of the vertices it is associated with. Centralities distinguish themselves on how association is defined.
The characterization by walk structure shows that almost all centralities in wide use are radial-volume measures. These encode the belief that a vertex's centrality is a function of the centrality of the vertices it is associated with. Centralities distinguish themselves on how association is defined.
步行结构的特征表明，几乎所有广泛使用的中心性都是径向体积的衡量。这些得出结论顶点的中心性是与之相关联的顶点中心性的函数。中心性根据如何定义关联而不同。
The heart of such measures is the observation that powers of the graph's adjacency matrix gives the number of walks of length given by that power. Similarly, the matrix exponential is also closely related to the number of walks of a given length. An initial transformation of the adjacency matrix allows a different definition of the type of walk counted. Under either approach, the centrality of a vertex can be expressed as an infinite sum, either
The heart of such measures is the observation that powers of the graph's adjacency matrix gives the number of walks of length given by that power. Similarly, the matrix exponential is also closely related to the number of walks of a given length. An initial transformation of the adjacency matrix allows a different definition of the type of walk counted. Under either approach, the centrality of a vertex can be expressed as an infinite sum, either
这些测量方法的核心是这种现象：图中邻接矩阵的幂给出了由该幂给出的散步长度的数目。同样，矩阵指数也与给定长度的行走次数密切相关。邻接矩阵的初始转换允许对步行计数的类型进行不同的定义。无论采用哪种方法，顶点的中心性都可以表示为无穷和