gives a list of eccentricity centralities for the vertices in the graph g.
uses rules vw to specify the graph g.
- EccentricityCentrality will give high centralities to vertices that are at short maximum distances to every other reachable vertex.
- EccentricityCentrality for a graph g is given by , where is the maximum distance from vertex to all other vertices connected to .
- The eccentricity centrality for isolated vertices is taken to be zero.
- EccentricityCentrality works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.
Background & Context
- EccentricityCentrality returns a list of non-negative machine numbers ("eccentricity centralities") that approximate particular centrality measures of the vertices of a graph. Eccentricity centrality is a measure of the centrality of a node in a network based on having a small maximum distance from a node to every other reachable node (i.e. the graph eccentricities). This measure has found applications in social networks, transportation, biology, and the social sciences.
- If is the maximum distance from vertex to all other vertices connected to , then the eccentricity centralities are given by . The eccentricity centrality for isolated vertices is taken to be zero. Eccentricity centralities lie between 0 and 1 inclusive.
- The eccentricity centrality of a vertex is the reciprocal of its VertexEccentricity. The full distance matrix of a graph can be computed using GraphDistanceMatrix.
Examplesopen allclose all
Basic Examples (2)
Highlight the eccentricity centrality for CycleGraph:
Properties & Relations (6)
EccentricityCentrality is the inverse of maximum distances to other reachable vertices:
Eccentricity centrality of a vertex is the reciprocal of the VertexEccentricity:
Use GraphCenter to find vertices with the highest eccentricity centrality:
Use VertexIndex to obtain the centrality for a specific vertex: