dangalchev_closeness_centrality {CINNA}

Dangalchev Closeness Centrality

Description

This function computes the Dangalchev Closeness Centrality for nodes in a network. The Dangalchev Closeness Centrality measures closeness by removing nodes and edges, allowing for easier evaluation and handling of unconnected graphs.

Usage

dangalchev_closeness_centrality(
  x,
  vids = V(x),
  mode = c("all", "out", "in"),
  weights = NULL
)

Arguments

x

An igraph or a network object.

vids

Nodes to be considered in the calculation.

mode

A character value indicating whether the shortest paths "in" or "out" of the nodes in directed graphs should be considered. For undirected graphs, use "all".

weights

A numeric vector indicating the weights of the edges.

Value

A numeric vector including the centrality values for each node. The centrality values represent the Dangalchev Closeness Centrality measure for each node in the network.

Author(s)

Minoo Ashtiani, Mehdi Mirzaie, Mohieddin Jafari

References

Dangalchev, C. (2006). Residual closeness in networks. Physica A: Statistical Mechanics and its Applications, 365, 556-564. DOI: 10.1016/j.physa.2005.12.020

See Also

closeness.residual

Examples

data(zachary)

dangalchev_closeness_centrality(zachary)