delta.score {keyplayer} | R Documentation |
The change on objective function for greedy search implimentation
Description
delta.score
calculates the change in group centrality score.
Usage
delta.score(
adj.matrix,
candidate,
residual,
i,
j,
type,
M = Inf,
T = ncol(adj.matrix),
method,
binary = FALSE,
cmode,
large = TRUE,
geodist.precomp = NULL
)
Arguments
adj.matrix |
The adjacency matrix of the network. |
candidate |
An initial set of players selected. |
residual |
The remaining players in the network without members in the initial set. |
i |
The specific member in the candidate set to be replaced |
j |
The specific member in the residual set to replace |
type |
Choose
|
M |
Positive number indicating the maximum distance between two nodes,
above witch the two nodes are considered disconnected. The default is
|
T |
Integer indicating the maximum number of iterations of communication process. For diffusion centrality only. In the first iteration, the adjacency matrix is as the input. In the nth iteration, the adjacency matrix becomes the input adjacency matrix to the power of n. By default, T is the network size. |
method |
Indication of which grouping criterion should be used.
|
binary |
If |
cmode |
String indicating the type of centrality being evaluated.
The option is applicable to degree, mreach.degree, and mreach.closeness centralities.
The default is to report the total degree.
|
large |
Logical scalar, whether the computation method for large network is
implemented. If |
geodist.precomp |
Geodistance precomputed for the graph to be analyzed (optional). |
Value
The change in group centrality score