7.17.5. networkx.algorithms.cuts.mixing_expansion¶

networkx.algorithms.cuts.mixing_expansion(G, S, T=None, weight=None)[source]¶

Returns the mixing expansion between two node sets.

The mixing expansion is the quotient of the cut size and twice the number of edges in the graph. [1]

Parameters:	G : NetworkX graph S : sequence A sequence of nodes in G. T : sequence A sequence of nodes in G. weight : object Edge attribute key to use as weight. If not specified, edges have weight one.
Returns:	number The mixing expansion between the two sets S and T.

See also

boundary_expansion, edge_expansion, node_expansion

References

[R623]

Vadhan, Salil P. “Pseudorandomness.” Foundations and Trends in Theoretical Computer Science 7.1–3 (2011): 1–336. <http://dx.doi.org/10.1561/0400000010>