degree_c {wdnet} | R Documentation |
Degree-based centrality
Description
Compute the degree centrality measures of the vertices in a weighted and directed network represented through its adjacency matrix.
Usage
degree_c(adj, alpha = 1, mode = "out")
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. |
Value
a list of node names and associated degree centrality measures
Note
Function degree_c
is an extension of function strength
in
package igraph
and an alternative of function degree_w
in
package tnet
. Function degree_c
uses adjacency matrix as
input.
References
Opsahl, T., Agneessens, F., Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32, 245–251.
Zhang, P., Zhao, J. and Yan, J. (2020+) Centrality measures of networks with application to world input-output tables