% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{centrality_information}
\alias{centrality_information}
\title{Information Centrality (Stephenson-Zelen)}
\usage{
centrality_information(x, ...)
}
\arguments{
\item{x}{Network input (matrix, igraph, network, cograph_network, tna object).}

\item{...}{Additional arguments passed to \code{\link{centrality}}.}
}
\value{
Named numeric vector of information centrality values.
}
\description{
Information centrality (Stephenson & Zelen 1989) measures a node's
importance in terms of the "information" contained in all paths (not only
shortest) passing through it. Defined via the inverse of a Laplacian-like
matrix, yielding per-node
\eqn{IC_i = 1 / (C_{ii} + (\mathrm{tr}(C) - 2 R_i) / n)} where
\eqn{C = A^{-1}} and \eqn{R_i} is the row sum of \eqn{C}.
}
\details{
Bit-exact match against \code{sna::infocent} on connected undirected
graphs (cograph mirrors sna's exact construction and call sequence).
}
\examples{
adj <- matrix(c(0,1,1,0, 1,0,1,1, 1,1,0,1, 0,1,1,0), 4, 4)
rownames(adj) <- colnames(adj) <- LETTERS[1:4]
centrality_information(adj)
}
\references{
Stephenson, K., & Zelen, M. (1989). Rethinking centrality: Methods and
examples. \emph{Social Networks}, 11(1), 1-37.
}
\seealso{
\code{\link{centrality}}, \code{\link{centrality_current_flow_closeness}}.
}
