closeness_c {wdnet}R Documentation

Closeness centrality

Description

Compute the closeness centrality measures of the vertices in a weighted and directed network represented through its adjacency matrix.

Usage

closeness_c(
  adj,
  alpha = 1,
  mode = "out",
  method = "harmonic",
  distance = FALSE
)

Arguments

adj

is an adjacency matrix of a weighted and directed network

alpha

is a tuning parameter. The value of alpha must be nonnegative. By convention, alpha takes a value from 0 to 1 (default).

mode

which mode to compute: "out" (default) or "in"? For undirected networks, this setting is irrelevant.

method

which method to use: "harmonic" (default) or "standard"?

distance

whether to consider the entries in the adjacency matrix as distances or strong connections. The default setting is FALSE.

Value

a list of node names and associated closeness centrality measures

Note

Function closeness_c is an extension of function closeness in package igraph and function closeness_w in package tnet. The method of computing distances between vertices is the Dijkstra's algorithm.

References


[Package wdnet version 1.2.3 Index]