simmelian_strength: Simmelian Strength (Triangle Count per Edge)

In cograph: Analysis and Visualization of Complex Networks

Simmelian Strength (Triangle Count per Edge)

Description

Convenience wrapper around edge_centrality that returns only the triangle count per edge, sorted descending.

Usage

simmelian_strength(x, top = NULL, directed = NULL, digits = NULL, ...)

Arguments

x	Network input: matrix, igraph, network, cograph_network, or tna object.
top	Integer or NULL. Return only the top N edges. Default NULL.
directed	Logical or NULL. Default NULL (auto-detect).
digits	Integer or NULL. Round numeric columns. Default NULL.
...	Additional arguments passed to edge_centrality.

Value

A data frame sorted by triangles (descending) with columns: from, to, weight (if weighted), triangles.

See Also

edge_centrality, neighborhood_overlap

Examples

k4 <- matrix(1, 4, 4); diag(k4) <- 0
rownames(k4) <- colnames(k4) <- c("A", "B", "C", "D")
cograph::simmelian_strength(k4)

cograph documentation built on May 31, 2026, 5:06 p.m.