These functions offer methods for summarising the closure in configurations in one-, two-, and three-mode networks:
net_reciprocity() measures reciprocity in a (usually directed) network.
node_reciprocity() measures nodes' reciprocity.
net_transitivity() measures transitivity in a network.
node_transitivity() measures nodes' transitivity.
net_equivalency() measures equivalence or reinforcement
in a (usually two-mode) network.
net_congruency() measures congruency across two two-mode networks.
net_reciprocity(.data, method = "default")
node_reciprocity(.data)
net_transitivity(.data)
node_transitivity(.data)
net_equivalency(.data)
node_equivalency(.data)
net_congruency(.data, object2)An object of a manynet-consistent class:
matrix (adjacency or incidence) from {base} R
edgelist, a data frame from {base} R or tibble from {tibble}
igraph, from the {igraph} package
network, from the {network} package
tbl_graph, from the {tidygraph} package
For reciprocity, either default or ratio.
See ?igraph::reciprocity
Optionally, a second (two-mode) matrix, igraph, or tidygraph
For one-mode networks, shallow wrappers of igraph versions exist via
net_reciprocity and net_transitivity.
For two-mode networks, net_equivalency calculates the proportion of three-paths in the network
that are closed by fourth tie to establish a "shared four-cycle" structure.
For three-mode networks, net_congruency calculates the proportion of three-paths
spanning two two-mode networks that are closed by a fourth tie to establish a
"congruent four-cycle" structure.
The net_equivalency() function calculates the Robins and Alexander (2004)
clustering coefficient for two-mode networks.
Note that for weighted two-mode networks, the result is divided by the average tie weight.
Robins, Garry L, and Malcolm Alexander. 2004. Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Computational & Mathematical Organization Theory 10(1): 69–94. doi:10.1023/B:CMOT.0000032580.12184.c0 .
Knoke, David, Mario Diani, James Hollway, and Dimitris C Christopoulos. 2021. Multimodal Political Networks. Cambridge University Press. Cambridge University Press. doi:10.1017/9781108985000
Other measures:
measure_attributes,
measure_central_between,
measure_central_close,
measure_central_degree,
measure_central_eigen,
measure_cohesion,
measure_diffusion_infection,
measure_diffusion_net,
measure_diffusion_node,
measure_features,
measure_heterogeneity,
measure_hierarchy,
measure_holes,
measure_periods,
measure_properties,
member_diffusion
net_reciprocity(ison_southern_women)
#> [1] 1
node_reciprocity(to_unweighted(ison_networkers))
#> `Lin Freeman` `Doug White` `Ev Rogers` `Richard Alba` `Phipps Arabie`
#> 1 0.935 0.75 1 0.944 0.286
#> # ... with 27 more values from this nodeset unprinted. Use `print(..., n = Inf)` to print all values.
net_transitivity(ison_adolescents)
#> [1] 0.45
node_transitivity(ison_adolescents)
#> Betty Sue Alice Jane Dale Pam Carol Tina
#> 1 NaN 0.333 0.5 1 0.667 0.333 0 NaN
net_equivalency(ison_southern_women)
#> [1] 0.468
node_equivalency(ison_southern_women)
#> Evelyn Laura Theresa Brenda Charlotte Frances Eleanor Pearl Ruth Verne Myra
#> 1 0.676 0.633 0.725 0.651 0.326 0.38 0.379 0.243 0.358 0.355 0.356
#> # ... with 7 more values from this nodeset unprinted. Use `print(..., n = Inf)` to print all values.
#> E1 E2 E3 E4 E5 E6 E7 E8 E9 E10 E11 E12 E13
#> 1 0.222 0.219 0.482 0.291 0.591 0.5 0.539 0.779 0.563 0.37 0.129 0.428 0.233
#> # ... with 1 more values from this nodeset unprinted. Use `print(..., n = Inf)` to print all values.