topnode
Orders players by individual centrality from high to low
topnode(
adj.matrix,
type,
M = Inf,
T = ncol(adj.matrix),
method,
binary = FALSE,
cmode,
large = TRUE,
geodist.precomp = NULL
)
A vector of indices by individual centrality from high to low
Matrix indicating the adjacency matrix of the network.
type="betweenness"
for betweenness
centrality.
type="closeness"
for closeness
centrality.
type="degree"
for degree
centraslity.
type="diffusion"
for diffusion
centrality.
type="evcent"
for evcent
(eigenvector) centrality.
type="fragment"
for fragment
centrality.
type="mreach.degree"
for mreach.degree
centrality.
type="mreach.closeness"
for mreach.closeness
centrality.
Positive number indicating the maximum geodistance between two nodes,
above witch the two nodes are considered disconnected. The default is
Inf
. The option is applicable to mreach.degree, mreach.closeness,
and fragmentation centralities.
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.
Indication of which grouping criterion should be used.
"min"
indicates the "minimum" criterion and is suggested for
betweenness, closeness, fragmentation, and M-reach centralities.
"max"
indicates the "maximum" criterion and is suggested for
degree and eigenvector centralities.
"add"
indicates the "addition" criterion and is suggested for
degree and eigenvector centralities as an altenative of "max".
"union"
indicates the "union" criterion and is suggested for
diffusion centrality.
By default, kpset uses "min".
See kpcent
Details section for explanations on grouping method.
If TRUE
, the adjacency matrix is binarized.
If FALSE
, the edge values are considered. By default, binary=FALSE
String indicating the type of centrality being evaluated.
The option is applicable to degree and M-reach centralities.
"outdegree"
, "indegree"
, and "total"
refer to
indegree, outdegree, and (total) degree respectively. "all"
reports
all the above measures. The default is to report the total degree.
The option also applies to closeness centrality, but with different options.
The default is to use the Gil-Schmidt power index as the closeness measure.
See closeness
for complete options.
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.
Geodistance precomputed for the graph to be analyzed (optional). #'