centrality_entropy: Entropy Centrality

In cograph: Analysis and Visualization of Complex Networks

Entropy Centrality

Description

Graph-theoretic entropy based on shortest path distribution in the residual graph after removing the node.

Usage

centrality_entropy(x, mode = "all", ...)

Arguments

x	Network input (matrix, igraph, network, cograph_network, tna object).
mode	For directed networks: "all" (default), "in", or "out".
...	Additional arguments passed to centrality (e.g., normalized, weighted, directed).

Value

Named numeric vector of entropy centrality values.

See Also

centrality for computing multiple measures at once.

Examples

adj <- matrix(c(0, 1, 1, 1, 0, 1, 1, 1, 0), 3, 3)
rownames(adj) <- colnames(adj) <- c("A", "B", "C")
centrality_entropy(adj)

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