networkx.algorithms.structuralholes.effective_size¶

effective_size(G, nodes=None, weight=None)[source]¶

Returns the effective size of all nodes in the graph G.

The effective size of a node’s ego network is based on the concept of redundancy. A person’s ego network has redundancy to the extent that her contacts are connected to each other as well. The nonredundant part of a person’s relationships it’s the effective size of her ego network [1]. Formally, the effective size of a node \(u\), denoted \(e(u)\), is defined by

\[e(u) = \sum_{v \in N(u) \setminus \{u\}} \left(1 - \sum_{w \in N(v)} p_{uw} m_{vw}\right)\]

where \(N(u)\) is the set of neighbors of \(u\) and \(p_{uw}\) is the normalized mutual weight of the (directed or undirected) edges joining \(u\) and \(v\), for each vertex \(u\) and \(v\) [1]. And \(m_{vw}\) is the mutual weight of \(v\) and \(w\) divided by \(v\) highest mutual weight with any of its neighbors. The mutual weight of \(u\) and \(v\) is the sum of the weights of edges joining them (edge weights are assumed to be one if the graph is unweighted).

For the case of unweighted and undirected graphs, Borgatti proposed a simplified formula to compute effective size [2]

\[e(u) = n - \frac{2t}{n}\]

where t is the number of ties in the ego network (not including ties to ego) and n is the number of nodes (excluding ego).

Parameters:	G (NetworkX graph) – The graph containing `v`. Directed graphs are treated like undirected graphs when computing neighbors of `v`. nodes (container, optional) – Container of nodes in the graph `G` to compute the effective size. If None, the effective size of every node is computed. weight (None or string, optional) – If None, all edge weights are considered equal. Otherwise holds the name of the edge attribute used as weight.
Returns:	Dictionary with nodes as keys and the constraint on the node as values.
Return type:	dict

Notes

Burt also defined the related concept of efficiency of a node’s ego network, which is its effective size divided by the degree of that node [1]. So you can easily compute efficiency:

>>> G = nx.DiGraph()
>>> G.add_edges_from([(0, 1), (0, 2), (1, 0), (2, 1)])
>>> esize = nx.effective_size(G)
>>> efficiency = {n: v / G.degree(n) for n, v in esize.items()}