dangalchev_closeness_centrality: Dangalchev Closeness Centrality

Description Usage Arguments Value Author(s) References See Also Examples

Description

This function computes Dangalchev Closeness Centrality. This can be access by computing a network resistance. More specifically, it measures the closeness by removing nodes and edges. The evalauation of this measure of closeness will be easier and this can be useful for unconnected graphs too.

Usage

1
2
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 the directed graphs should be considered. For undirected graphs we use "all".

weights

Numeric vector indicating weights of the edges

Value

a vector including centrality values for each node

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

1
2
3

CINNA documentation built on May 2, 2019, 1:01 a.m.