centrality_decay: Decay Centrality

View source: R/centrality.R

centrality_decayR Documentation

Decay Centrality

Description

Decay centrality sums a decay factor \delta raised to the distance from the node to every node:

D(v) = \sum_{w} \delta^{d(v, w)}.

The sum includes the node itself, which adds one to every score, and unreachable nodes contribute 0. Values of \delta between 0 and 1 discount distant nodes.

Usage

centrality_decay(x, mode = "all", decay_parameter = 0.5, ...)

Arguments

x

Network input accepted by centrality.

mode

For directed networks: "all" (default), "out" or "in".

decay_parameter

Decay factor \delta. Default 0.5.

...

Further arguments to centrality. The measure uses weighted (default TRUE), invert_weights (default NULL, which is TRUE for tna input), alpha (inversion exponent, default 1) and cutoff (largest path length considered, default -1 for no limit).

Details

Edge weights are read as path lengths. invert_weights = TRUE uses 1/w^\alpha as the length, and weighted = FALSE counts hops. mode sets the direction of the paths. decay_parameter must lie strictly between 0 and 1, and other values raise a cograph_bad_parameter error. centrality_generalized_closeness computes the same quantity, and decay_parameter = 0.5 gives centrality_dangalchev.

Value

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

See Also

centrality_generalized_closeness, centrality_dangalchev, centrality.

Examples

centrality_decay(regulation_net)

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