Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

# networkx.algorithms.centrality.betweenness_centrality_subset¶

betweenness_centrality_subset(G, sources, targets, normalized=False, weight=None)[source]

Compute betweenness centrality for a subset of nodes.

$c_B(v) =\sum_{s\in S, t \in T} \frac{\sigma(s, t|v)}{\sigma(s, t)}$

where $$S$$ is the set of sources, $$T$$ is the set of targets, $$\sigma(s, t)$$ is the number of shortest $$(s, t)$$-paths, and $$\sigma(s, t|v)$$ is the number of those paths passing through some node $$v$$ other than $$s, t$$. If $$s = t$$, $$\sigma(s, t) = 1$$, and if $$v \in {s, t}$$, $$\sigma(s, t|v) = 0$$ [2].

Parameters: G (graph) – A NetworkX graph. sources (list of nodes) – Nodes to use as sources for shortest paths in betweenness targets (list of nodes) – Nodes to use as targets for shortest paths in betweenness normalized (bool, optional) – If True the betweenness values are normalized by $$2/((n-1)(n-2))$$ for graphs, and $$1/((n-1)(n-2))$$ for directed graphs where $$n$$ is the number of nodes in G. weight (None or string, optional (default=None)) – If None, all edge weights are considered equal. Otherwise holds the name of the edge attribute used as weight. nodes – Dictionary of nodes with betweenness centrality as the value. dictionary

Notes

The basic algorithm is from [1].

For weighted graphs the edge weights must be greater than zero. Zero edge weights can produce an infinite number of equal length paths between pairs of nodes.

The normalization might seem a little strange but it is the same as in betweenness_centrality() and is designed to make betweenness_centrality(G) be the same as betweenness_centrality_subset(G,sources=G.nodes(),targets=G.nodes()).

References

 [1] Ulrik Brandes, A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2):163-177, 2001. http://www.inf.uni-konstanz.de/algo/publications/b-fabc-01.pdf
 [2] Ulrik Brandes: On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. Social Networks 30(2):136-145, 2008. http://www.inf.uni-konstanz.de/algo/publications/b-vspbc-08.pdf