group.mreach.degree: Compute the group-level mreach.degree Centrality Score in a...

View source: R/keyplayer.R

group.mreach.degreeR Documentation

Compute the group-level mreach.degree Centrality Score in a Netwrok

Description

group.mreach.degree computes the size of the reachable nodes from a particular node within M steps.

Usage

group.mreach.degree(
  adj.matrix,
  nodes,
  M = Inf,
  method = "min",
  binary = TRUE,
  cmode = "total",
  large = TRUE,
  geodist.precomp = NULL
)

Arguments

adj.matrix

Matrix indicating the adjacency matrix of the network.

nodes

Integer indicating the column index of the chosen player in the adjacenncy matrix. If there are multiple players, use c(index1,index2,...)

M

Number indicating the maximum distance between two nodes, above which the two nodes are considered disconnected. m hence defines a reachable set. The default is Inf.

method

Indication of which grouping criterion should be used. method="min" indicates the "minimum" criterion (edge values as distances). method="max" indicates the "maximum" criterion (edge values as non-cummulative strengths). method="add" indicates the "addition" criterion (edge values as cummulative strengths). method="union" indicates the "union" criterion (edge values as probability). The default is the "minimum" criterion for mreach.degree centrality.

binary

If TRUE, the adjacency matrix is binarized. If FALSE, the edge values are considered.

cmode

String indicating the type of centrality being evaluated. The default is to report the total degree. "outdegree" and "indegree" refer to indegree and outdegree respectively. If "all", all the three types are reported.

large

Logical scalar, whether the computation method for large network is implemented. If TRUE (the default), the method implmented in igraph is used; otherwise the method implemented in sna is used.

geodist.precomp

Geodistance precomputed for the graph to be analyzed (optional).

Value

A vector indicating the outdegree, indegree, or total-degree mreach.degree score of the chosen player(s); or a data frame containing all the above information.

Author(s)

Weihua An weihua.an@emory.edu; Yu-Hsin Liu ugeneliu@meta.com


keyplayer documentation built on Nov. 8, 2023, 9:06 a.m.