File: centralization.evcent.Rd

package info (click to toggle)
r-cran-igraph 2.2.2-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 27,772 kB
  • sloc: ansic: 206,420; cpp: 21,827; fortran: 4,090; yacc: 1,229; lex: 518; sh: 52; makefile: 8
file content (36 lines) | stat: -rw-r--r-- 1,387 bytes parent folder | download
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
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centralization.R
\name{centralization.evcent}
\alias{centralization.evcent}
\title{Centralize a graph according to the eigenvector centrality of vertices}
\usage{
centralization.evcent(
  graph,
  directed = FALSE,
  scale = TRUE,
  options = arpack_defaults(),
  normalized = TRUE
)
}
\arguments{
\item{graph}{The input graph.}

\item{directed}{logical scalar, whether to use directed shortest paths for
calculating eigenvector centrality.}

\item{scale}{\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}} Ignored. Computing
eigenvector centralization requires normalized eigenvector centrality scores.}

\item{options}{This is passed to \code{\link[=eigen_centrality]{eigen_centrality()}}, the options
for the ARPACK eigensolver.}

\item{normalized}{Logical scalar. Whether to normalize the graph level
centrality score by dividing by the theoretical maximum.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{centralization.evcent()} was renamed to \code{\link[=centr_eigen]{centr_eigen()}} to create a more
consistent API.
}
\keyword{internal}