Data Engineering and BI courses are free this week!
This function measures constraint for both one-mode and two-mode networks.
For one-mode networks, the function wraps the implementation of Ron Burt's measure
in {igraph}.
For two-mode networks, the function employs the extension outlined in Hollway et al. (2020).
node_constraint(object, nodes = V(object), weights = NULL)A matrix, igraph graph, or tidygraph object.
The vertices for which the constraint will be calculated. Defaults to all vertices.
The weights of the edges. If this is NULL and there is a weight edge attribute this is used. If there is no such edge attribute all edges will have the same weight.
A named vector (one-mode) or a list of two named vectors ($nodes1, $nodes2).
Hollway, James, Jean-Fr<U+00E9>d<U+00E9>ric Morin, and Joost Pauwelyn. 2020. "Structural conditions for novelty: the introduction of new environmental clauses to the trade regime complex." International Environmental Agreements: Politics, Law and Economics 20 (1): 61<U+2013>83.
Other one-mode measures:
graph_clustering()
Other two-mode measures:
centrality,
centralization,
graph_clustering(),
node_smallworld()
Other node-level measures:
centrality,
node_smallworld()
# NOT RUN {
node_constraint(southern_women)
# }
Run the code above in your browser using DataLab