migraph (version 0.9.3)

cohesion: Cohesion for one-, two-, and three- mode networks

Description

These functions offer methods for summarising the cohesion in one-, two-, and three-mode networks.

Usage

graph_density(object)
edge_reciprocal(object)
graph_reciprocity(object, method = "default")
graph_transitivity(object)
graph_equivalency(object)
graph_congruency(object, object2)
edge_multiple(object)
edge_loop(object)

Arguments

object

A one-mode or two-mode matrix, igraph, or tidygraph

method

For reciprocity, either default or ratio. See ?igraph::reciprocity

object2

Optionally, a second (two-mode) matrix, igraph, or tidygraph

Functions

• edge_reciprocal: Identify edges that are mutual/reciprocated

• graph_reciprocity: Calculate reciprocity in a network

• graph_transitivity: Calculate transitivity in a network

• graph_equivalency: Calculate equivalence or reinforcement in a network

• graph_congruency: Calculate congruency in a network

• edge_multiple: Identify edges that are multiples

• edge_loop: Identify edges that are loops

Details

For one- and two-mode networks, graph_density summarises the ratio of ties to the number of possible ties.

For one-mode networks, shallow wrappers of igraph versions exist via graph_reciprocity and graph_transitivity.

For two-mode networks, graph_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, graph_congruency calculates the proportion of three-paths spanning the two two-mode networks that are closed by a fourth tie to establish a "congruent four-cycle" structure.

References

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<U+2013>94.

Knoke, David, Mario Diani, James Hollway, and Dimitris C Christopoulos. 2021. Multimodal Political Networks. Cambridge University Press. Cambridge University Press.

See Also

Other one-mode measures: node_constraint()

Other two-mode measures: graph_smallworld(), node_constraint()

Examples

# NOT RUN {
graph_density(mpn_elite_mex)
graph_density(mpn_elite_usa_advice)
edge_reciprocal(ison_algebra)
graph_reciprocity(ison_southern_women)
graph_transitivity(ison_southern_women)
graph_equivalency(ison_southern_women)
edge_multiple(ison_algebra)
edge_loop(ison_algebra)
# }