centrality_subgraph: Subgraph Centrality

View source: R/centrality.R

centrality_subgraphR Documentation

Subgraph Centrality

Description

Subgraph centrality (Estrada and Rodriguez-Velazquez 2005) counts the closed walks that start and end at a node, weighting a walk of length k by 1/k!:

SC(i) = \sum_{k=0}^{\infty} \frac{(A^k)_{ii}}{k!} = \left(e^{A}\right)_{ii}.

Usage

centrality_subgraph(x, ...)

Arguments

x

Network input accepted by centrality.

...

Further arguments to centrality.

Details

A is the binary adjacency matrix without self-loops, so edge weights are ignored. On a directed network A is replaced by A + A^{T}, so a reciprocated pair has entry 2; the values then equal igraph::subgraph_centrality(). An empty network raises an error.

Value

A named numeric vector with one score per node, in input node order.

References

Estrada, E., & Rodriguez-Velazquez, J. A. (2005). Subgraph centrality in complex networks. Physical Review E, 71(5), 056103. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1103/PhysRevE.71.056103")}.

See Also

centrality_communicability, centrality_eigenvector, centrality.

Examples

centrality_subgraph(regulation_net)

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