edge_centrality: Calculate Edge Centrality Measures

View source: R/centrality.R

edge_centralityR Documentation

Calculate Edge Centrality Measures

Description

Computes centrality measures for the edges of a network and returns a tidy data frame with one row per edge.

Usage

edge_centrality(
  x,
  measures = "all",
  weighted = TRUE,
  directed = NULL,
  cutoff = -1,
  invert_weights = NULL,
  alpha = 1,
  digits = NULL,
  sort_by = NULL,
  ...
)

edge_betweenness(x, ...)

Arguments

x

Network input (matrix, edge-list data frame, igraph, network, cograph_network, tna object).

measures

Which measures to calculate. Default "all" calculates all available edge measures. Options: "betweenness", "weight", "overlap", "simmelian", "reciprocity".

weighted

Logical. Use edge weights if available. Default TRUE.

directed

Logical or NULL. If NULL (default), auto-detect from matrix symmetry. Set TRUE to force directed, FALSE to force undirected.

cutoff

Maximum path length for betweenness. Default -1 (no limit).

invert_weights

Logical or NULL. Whether edge betweenness inverts the weights, so that higher weights mean shorter paths. The default NULL is TRUE for tna objects and FALSE otherwise.

alpha

Numeric. Exponent of the inversion, which computes distances as 1 / weight^alpha. Default 1.

digits

Integer or NULL. Round numeric columns. Default NULL.

sort_by

Character or NULL. Column to sort by (descending). Default NULL.

...

For edge_centrality(), the graph-construction arguments loops and simplify (see centrality). For edge_betweenness(), arguments passed to edge_centrality().

Details

Edge measures available, with the column(s) each one adds:

betweenness

Edge betweenness, the sum over node pairs of the share of their shortest paths that pass through the edge. Adds betweenness.

weight

Original edge weight (1 for an unweighted input). Adds weight.

overlap

Jaccard neighborhood overlap of the edge endpoints. Adds overlap and the raw count shared_neighbors.

simmelian

Number of triangles the edge participates in. Adds triangles (there is no column called simmelian).

reciprocity

Whether the reverse edge exists. Directed only: on an undirected input it warns and adds nothing. Adds reciprocated, reverse_weight and weight_ratio, the last two NA where the edge is not reciprocated.

measures = "all" requests every measure, dropping reciprocity on an undirected input.

Value

edge_centrality() returns a base data.frame with one row per edge, in the canonical (row-major) edge order of the input. The first two columns are from and to (character when the input carried node names, numeric indices otherwise); the remaining columns are those the requested measures contribute, as listed in Details. measures = "all" on an undirected input therefore gives from, to, weight, betweenness, overlap, shared_neighbors and triangles, and a directed input adds reciprocated, reverse_weight and weight_ratio.

edge_betweenness() returns a numeric vector of edge betweenness values named "from->to", for directed and undirected inputs alike.

Examples

edge_centrality(regulation_net, measures = "betweenness")

cograph documentation built on Nov. 19, 2026, 5:07 p.m.