migraph (version 0.9.3)

centrality: Centrality and centralization for one- and two-mode networks

Description

These functions calculate common centrality measures for one- and two-mode networks. All measures attempt to use as much information as they are offered, including whether the networks are directed or weighted. If this would produce unintended results, first transform the salient properties using e.g. to_undirected() functions. All centrality and centralization measures return normalized measures by default, including for two-mode networks.

Usage

node_degree(object, normalized = TRUE, direction = c("all", "out", "in"))
edge_degree(object, normalized = TRUE)
graph_degree(object, normalized = TRUE, direction = c("all", "out", "in"))
node_closeness(object, normalized = TRUE, direction = "out", cutoff = NULL)
edge_closeness(object, normalized = TRUE)
graph_closeness(object, normalized = TRUE, direction = c("all", "out", "in"))
node_betweenness(object, normalized = TRUE, cutoff = NULL, nobigint = TRUE)
edge_betweenness(object, normalized = TRUE)
graph_betweenness(object, normalized = TRUE, direction = c("all", "out", "in"))
node_eigenvector(object, normalized = TRUE, scale = FALSE)
edge_eigenvector(object, normalized = TRUE)
graph_eigenvector(object, normalized = TRUE)

Arguments

object

An object of a migraph-consistent class:

• matrix, 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

normalized

Logical scalar, whether the centrality scores are normalized. Different denominators are used depending on whether the object is one-mode or two-mode, the type of centrality, and other arguments.

direction

Character string, <U+201C>out<U+201D> bases the measure on outgoing ties, <U+201C>in<U+201D> on incoming ties, and "all" on either/the sum of the two. For two-mode networks, "all" uses as numerator the sum of differences between the maximum centrality score for the mode against all other centrality scores in the network, whereas "in" uses as numerator the sum of differences between the maximum centrality score for the mode against only the centrality scores of the other nodes in that mode.

cutoff

Maximum path length to use during calculations.

nobigint

Whether big integers should be avoided during calculations

scale

Logical scalar, whether to rescale the vector so the maximum score is 1.

Value

A single centralization score if the object was one-mode, and two centralization scores if the object was two-mode.

Depending on how and what kind of an object is passed to the function, the function will return a tidygraph object where the nodes have been updated

A numeric vector giving the betweenness centrality measure of each node.

A numeric vector giving the eigenvector centrality measure of each node.

Functions

• node_degree: Calculates the degree centrality of nodes in an unweighted network, or weighted degree/strength of nodes in a weighted network.

• edge_degree: Calculate the degree centrality of edges in a network

• graph_degree: Calculate the degree centralization for a graph

• node_closeness: Calculate the closeness centrality of nodes in a network

• edge_closeness: Calculate the closeness of each edge to each other edge in the network.

• graph_closeness: Calculate the closeness centralization for a graph

• node_betweenness: Calculate the betweenness centralities of nodes in a network

• edge_betweenness: Calculate number of shortest paths going through an edge

• graph_betweenness: Calculate the betweenness centralization for a graph

• node_eigenvector: Calculate the eigenvector centrality of nodes in a network

• edge_eigenvector: Calculate the eigenvector centrality of edges in a network

• graph_eigenvector: Calculate the eigenvector centralization for a graph

References

Faust, Katherine (1997). "Centrality in affiliation networks." Social Networks 19(2): 157-191. https://doi.org/10.1016/S0378-8733(96)00300-0

Borgatti, Stephen P., and Martin G. Everett (1997). "Network analysis of 2-mode data." Social Networks 19(3): 243-270. https://doi.org/10.1016/S0378-8733(96)00301-2

Borgatti, Stephen P, and Daniel S Halgin. (2011). "Analyzing affiliation networks." In The SAGE Handbook of Social Network Analysis, edited by John Scott and Peter J Carrington, 417<U+2013>33. London, UK: Sage. https://dx.doi.org/10.4135/9781446294413.n28

Bonacich, Phillip. 1991. <U+201C>Simultaneous Group and Individual Centralities.<U+201D> Social Networks 13(2):155<U+2013>68. 10.1016/0378-8733(91)90018-O.

See Also

to_undirected() for removing edge directions and to_unweighted() for removing weights from a graph.

Examples

# NOT RUN {
node_degree(mpn_elite_mex)
node_degree(ison_southern_women)
edge_degree(ison_adolescents)
graph_degree(ison_southern_women, direction = "in")
node_closeness(mpn_elite_mex)
node_closeness(ison_southern_women)
(ec <- edge_closeness(ison_adolescents))
plot(ec)
ison_adolescents %>% 
  activate(edges) %>% mutate(weight = ec) %>% 
  autographr()
graph_closeness(ison_southern_women, direction = "in")
node_betweenness(mpn_elite_mex)
node_betweenness(ison_southern_women)
(eb <- edge_betweenness(ison_adolescents))
plot(eb)
ison_adolescents %>% 
  activate(edges) %>% mutate(weight = eb) %>% 
  autographr()
graph_betweenness(ison_southern_women, direction = "in")
node_eigenvector(mpn_elite_mex)
node_eigenvector(ison_southern_women)
edge_eigenvector(ison_adolescents)
graph_eigenvector(mpn_elite_mex)
graph_eigenvector(ison_southern_women)
# }