MATHEMATICA 内置符号

ClosenessCentrality

ClosenessCentrality[g]
gives a list of closeness centralities for the vertices in the graph g.

更多信息

ClosenessCentrality for a graph g is given as where is the average distance from vertex to all other vertices connected to .

If is the distance matrix then the average distance from vertex to all connected vertices is given by , where the sum is taken over all finite and is the number of vertices connected to .

The closeness centrality for isolated vertices is taken to be zero.

范例

关闭所有单元

例 (2)

Find the closeness centrality for each vertex in a connected graph:

Closeness is computed separately for each connected component:

Find the closeness centrality for each vertex in a connected graph:

In[1]:=

Out[1]=

Closeness is computed separately for each connected component:

In[1]:=

Out[1]=

范围 (3)

ClosenessCentrality for undirected graphs:

Highlight the vertex with highest centrality:

Directed graphs:

Highlight the vertex with highest centrality:

Work with large graphs:

应用 (2)

Highlight the closeness centrality for CycleGraph:

An unbalanced tree:

Create a social network:

Find the people with more direct influence on others:

属性和关系 (3)

ClosenessCentrality is the inverse of average finite distances to other vertices:

An undirected graph:

A directed graph:

Closeness centrality for isolated vertices is taken to be zero:

Closeness centralities for an undirected graph are equivalent to centralities for each component:

Computing the centralities for each component yields the same result:

参见

BetweennessCentrality DegreeCentrality EigenvectorCentrality KatzCentrality PageRankCentrality HITSCentrality GraphCenter

更多关于

图度量法与度量

图与网络

Mathematica 8的新功能概要

8.0的新功能：字母列表

8.0的新功能：数学与算法

版本 8 的新功能