561
个编辑
更改
跳到导航
跳到搜索
第280行：
第280行： − + 第330行：
第330行： − −
→Important limitations
== Important limitations ==
== Important limitations ==
重要限制条件
Centrality indices have two important limitations, one obvious and the other subtle. The obvious limitation is that a centrality which is optimal for one application is often sub-optimal for a different application. Indeed, if this were not so, we would not need so many different centralities. An illustration of this phenomenon is provided by the [[Krackhardt kite graph]], for which three different notions of centrality give three different choices of the most central vertex.<ref>{{cite journal|title=Assessing the Political Landscape: Structure, Cognition, and Power in Organizations|first=David|last=Krackhardt|authorlink=David Krackhardt|journal=Administrative Science Quarterly|volume=35|issue=2|date=June 1990|pages=342–369|doi=10.2307/2393394|jstor=2393394}}</ref>
Centrality indices have two important limitations, one obvious and the other subtle. The obvious limitation is that a centrality which is optimal for one application is often sub-optimal for a different application. Indeed, if this were not so, we would not need so many different centralities. An illustration of this phenomenon is provided by the [[Krackhardt kite graph]], for which three different notions of centrality give three different choices of the most central vertex.<ref>{{cite journal|title=Assessing the Political Landscape: Structure, Cognition, and Power in Organizations|first=David|last=Krackhardt|authorlink=David Krackhardt|journal=Administrative Science Quarterly|volume=35|issue=2|date=June 1990|pages=342–369|doi=10.2307/2393394|jstor=2393394}}</ref>
复杂网络具有异构的拓扑结构。由于最佳度量取决于最重要顶点的网络结构，对于这些顶点最优的度量对于网络的其余部分是次优的。
复杂网络具有异构的拓扑结构。由于最佳度量取决于最重要顶点的网络结构，对于这些顶点最优的度量对于网络的其余部分是次优的。
==Degree centrality==
==Degree centrality==