1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centralization.R
\name{centr_clo}
\alias{centr_clo}
\title{Centralize a graph according to the closeness of vertices}
\usage{
centr_clo(graph, mode = c("out", "in", "all", "total"), normalized = TRUE)
}
\arguments{
\item{graph}{The input graph.}
\item{mode}{This is the same as the \code{mode} argument of
\code{closeness()}.}
\item{normalized}{Logical scalar. Whether to normalize the graph level
centrality score by dividing by the theoretical maximum.}
}
\value{
A named list with the following components:
\item{res}{The node-level centrality scores.}
\item{centralization}{The graph level centrality index.}
\item{theoretical_max}{The maximum theoretical graph level
centralization score for a graph with the given number of vertices,
using the same parameters. If the \code{normalized} argument was
\code{TRUE}, then the result was divided by this number.}
}
\description{
See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
}
\examples{
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_degree(g)$centralization
centr_clo(g, mode = "all")$centralization
centr_betw(g, directed = FALSE)$centralization
centr_eigen(g, directed = FALSE)$centralization
}
\seealso{
Other centralization related:
\code{\link{centr_betw}()},
\code{\link{centr_betw_tmax}()},
\code{\link{centr_clo_tmax}()},
\code{\link{centr_degree}()},
\code{\link{centr_degree_tmax}()},
\code{\link{centr_eigen}()},
\code{\link{centr_eigen_tmax}()},
\code{\link{centralize}()}
}
\concept{centralization related}
\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness}{\code{igraph_centralization_closeness()}}.}
|
