561
个编辑
更改
跳到导航
跳到搜索
第1行：
第1行： − 此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。+ 第13行：
第13行： − 在图论和网络分析中，中心性指标识别图中最重要的顶点。应用程序包括识别社会网络中最有影响力的人、互联网或城市网络中的关键基础设施节点以及疾病的超级传播者。中心性概念最初是在社会网络分析中发展起来的，用来衡量中心性的许多术语反映了它们的社会学起源。+ 第19行：
第19行： − 它们不应与节点影响度量相混淆，后者寻求量化网络中每个节点的影响。+ 第113行：
第113行： − 当中心性按照它们对内聚性的趋近程度来分类时，很明显，大多数中心性都集中在一个类别中。从一个给定的顶点开始的步数的计数只在行走的定义和计数方式上有所不同。限制对这个群体的考虑允许一个软角色塑造，它将集中点放在一个从一级行走(度集中性)到无限行走(特征值集中性)的频谱上。观察到许多中心分享这种家庭关系，也许可以解释这些指数之间的高阶相关性。+ 第131行：
第131行： − 同样，路径类型可以被约束为测地线(最短路径)、路径(没有顶点被访问超过一次)、路径(可以访问多次顶点，没有边被访问超过一次)或者行走(可以访问/遍历多次顶点和边)。+
无编辑摘要
此词条暂由水流心不竞初译，未经审校，带来阅读不便，请见谅。
{{for|the statistical concept|Central tendency}}
{{for|the statistical concept|Central tendency}}
In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, and super-spreaders of disease. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.
In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, and super-spreaders of disease. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.
在图论和网络分析中，中心性指标识别出一个图中最重要的顶点。用于识别社会网络中最有影响力的人、互联网或城市网络中的基础设施关键节点以及疾病的超级传播者。中心性概念最初在社会网络分析中发展起来，用来衡量中心性的许多术语反映了它们的社会学起源。
They should not be confused with [[node influence metric]]s, which seek to quantify the influence of every node in the network.
They should not be confused with [[node influence metric]]s, which seek to quantify the influence of every node in the network.
They should not be confused with node influence metrics, which seek to quantify the influence of every node in the network.
They should not be confused with node influence metrics, which seek to quantify the influence of every node in the network.
它们（中心性）不应与节点影响度相混淆，后者意在量化网络中每个节点的影响。
When centralities are categorized by their approach to cohesiveness, it becomes apparent that the majority of centralities inhabit one category. The count of the number of walks starting from a given vertex differs only in how walks are defined and counted. Restricting consideration to this group allows for a soft characterization which places centralities on a spectrum from walks of length one (degree centrality) to infinite walks (eigenvalue centrality). The observation that many centralities share this familial relationships perhaps explains the high rank correlations between these indices.
When centralities are categorized by their approach to cohesiveness, it becomes apparent that the majority of centralities inhabit one category. The count of the number of walks starting from a given vertex differs only in how walks are defined and counted. Restricting consideration to this group allows for a soft characterization which places centralities on a spectrum from walks of length one (degree centrality) to infinite walks (eigenvalue centrality). The observation that many centralities share this familial relationships perhaps explains the high rank correlations between these indices.
当中心性按照它们对内聚性的趋近程度来分类时，很明显，大多数中心性都集中在一个类别中。从一个给定顶点开始对步数的计数只在行走的定义和计数方式上有所不同。限制对这个群体的考虑允许一个软角色塑造，它将集中点放在一个从一级行走(度集中性)到无限行走(特征值集中性)的频谱上。观察到许多中心分享这种相似关系，也许可以解释这些指数之间的高阶相关性。
Likewise, the type of path can be constrained to geodesics (shortest paths), paths (no vertex is visited more than once), trails (vertices can be visited multiple times, no edge is traversed more than once), or walks (vertices and edges can be visited/traversed multiple times).
Likewise, the type of path can be constrained to geodesics (shortest paths), paths (no vertex is visited more than once), trails (vertices can be visited multiple times, no edge is traversed more than once), or walks (vertices and edges can be visited/traversed multiple times).
同样，路径类型可以被限定为测地线(最短路径)、路径(对顶点的访问不超过一次)、轨迹(可以访问多次顶点，没有边被访问超过一次)或者步子(可以访问/遍历多次顶点和边)。