kpnode | R Documentation |
kpnode
returns the node with the highest centrality score.
kpnode(
adj.matrix,
type,
M = Inf,
T = ncol(adj.matrix),
method,
binary = FALSE,
cmode,
large = TRUE,
geodist.precomp = NULL
)
adj.matrix |
Matrix indicating the adjacency matrix of the network. |
type |
|
M |
Positive number indicating the maximum geodistance 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 and M-reach centralities.
|
large |
Logical scalar, whether the computation method for large network is
implemented. If |
geodist.precomp |
Geodistance precomputed for the graph to be analyzed (optional). |
The most central player and its centrality score
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.