561
个编辑
更改
→Katz centrality
Katz centrality is a generalization of degree centrality. Degree centrality measures the number of direct neighbors, and Katz centrality measures the number of all nodes that can be connected through a path, while the contributions of distant nodes are penalized. Mathematically, it is defined as
Katz centrality is a generalization of degree centrality. Degree centrality measures the number of direct neighbors, and Katz centrality measures the number of all nodes that can be connected through a path, while the contributions of distant nodes are penalized. Mathematically, it is defined as
Katz 中心性是程度中心性的推广。程度中心性度量的是直接邻居的数量，Katz 中心性度量的是通过一条路径可以连接的所有节点的数量，而远处节点的贡献会受到惩罚。在数学上，它被定义为
Katz 中心性是度中心性的推广。度中心性度量的是直接邻居的数量，Katz 中心性度量的是通过一条路径可以连接的所有节点的数量，而远处节点的贡献会受到削弱（惩罚？）。在数学上，它被定义为
结果表明，主特征向量(与 < math > a </math > ，邻接矩阵的最大特征值相关)是 Katz 中心性的极限，因为 < math > alpha </math > 接近 < math > tfrac {1}{ lambda } </math > 。
结果表明，主特征向量(与 < math > a </math > ，邻接矩阵的最大特征值相关)是 Katz 中心性的极限，因为 < math > alpha </math > 接近 < math > tfrac {1}{ lambda } </math > 。
== PageRank centrality ==
== PageRank centrality ==