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
method: For reciprocity, either default or ratio. See ?igraph::reciprocity
object2: Optionally, a second (two-mode) matrix, igraph, or tidygraph
Details
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.
Equivalency
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. tools:::Rd_expr_doi("10.1023/B:CMOT.0000032580.12184.c0") .
On congruency
Knoke, David, Mario Diani, James Hollway, and Dimitris C Christopoulos. 2021. Multimodal Political Networks. Cambridge University Press. Cambridge University Press. tools:::Rd_expr_doi("10.1017/9781108985000")