% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{power_centrality}
\alias{power_centrality}
\title{Find Bonacich Power Centrality Scores of Network Positions}
\usage{
power_centrality(
  graph,
  nodes = V(graph),
  loops = FALSE,
  exponent = 1,
  rescale = FALSE,
  tol = 1e-07,
  sparse = TRUE
)
}
\arguments{
\item{graph}{the input graph.}

\item{nodes}{vertex sequence indicating which vertices are to be included in
the calculation.  By default, all vertices are included.}

\item{loops}{boolean indicating whether or not the diagonal should be
treated as valid data.  Set this true if and only if the data can contain
loops.  \code{loops} is \code{FALSE} by default.}

\item{exponent}{exponent (decay rate) for the Bonacich power centrality
score; can be negative}

\item{rescale}{if true, centrality scores are rescaled such that they sum to
1.}

\item{tol}{tolerance for near-singularities during matrix inversion (see
\code{\link[=solve]{solve()}})}

\item{sparse}{Logical scalar, whether to use sparse matrices for the
calculation. The \sQuote{Matrix} package is required for sparse matrix
support}
}
\value{
A vector, containing the centrality scores.
}
\description{
\code{power_centrality()} takes a graph (\code{dat}) and returns the Boncich power
centralities of positions (selected by \code{nodes}).  The decay rate for
power contributions is specified by \code{exponent} (1 by default).
}
\details{
Bonacich's power centrality measure is defined by
\eqn{C_{BP}\left(\alpha,\beta\right)=\alpha\left(\mathbf{I}-\beta\mathbf{A}\right)^{-1}\mathbf{A}\mathbf{1}}{C_BP(alpha,beta)=alpha
(I-beta A)^-1 A 1}, where \eqn{\beta}{beta} is an attenuation parameter (set
here by \code{exponent}) and \eqn{\mathbf{A}}{A} is the graph adjacency
matrix.  (The coefficient \eqn{\alpha}{alpha} acts as a scaling parameter,
and is set here (following Bonacich (1987)) such that the sum of squared
scores is equal to the number of vertices.  This allows 1 to be used as a
reference value for the ``middle'' of the centrality range.)  When
\eqn{\beta \rightarrow }{beta->1/lambda_A1}\eqn{
1/\lambda_{\mathbf{A}1}}{beta->1/lambda_A1} (the reciprocal of the largest
eigenvalue of \eqn{\mathbf{A}}{A}), this is to within a constant multiple of
the familiar eigenvector centrality score; for other values of \eqn{\beta},
the behavior of the measure is quite different.  In particular, \eqn{\beta}
gives positive and negative weight to even and odd walks, respectively, as
can be seen from the series expansion
\eqn{C_{BP}\left(\alpha,\beta\right)=\alpha \sum_{k=0}^\infty \beta^k
}{C_BP(alpha,beta) = alpha sum( beta^k A^(k+1) 1, k in 0..infinity )}\eqn{
\mathbf{A}^{k+1} \mathbf{1}}{C_BP(alpha,beta) = alpha sum( beta^k A^(k+1) 1,
k in 0..infinity )} which converges so long as \eqn{|\beta|
}{|beta|<1/lambda_A1}\eqn{ < 1/\lambda_{\mathbf{A}1}}{|beta|<1/lambda_A1}.
The magnitude of \eqn{\beta}{beta} controls the influence of distant actors
on ego's centrality score, with larger magnitudes indicating slower rates of
decay.  (High rates, hence, imply a greater sensitivity to edge effects.)

Interpretively, the Bonacich power measure corresponds to the notion that
the power of a vertex is recursively defined by the sum of the power of its
alters.  The nature of the recursion involved is then controlled by the
power exponent: positive values imply that vertices become more powerful as
their alters become more powerful (as occurs in cooperative relations),
while negative values imply that vertices become more powerful only as their
alters become \emph{weaker} (as occurs in competitive or antagonistic
relations).  The magnitude of the exponent indicates the tendency of the
effect to decay across long walks; higher magnitudes imply slower decay.
One interesting feature of this measure is its relative instability to
changes in exponent magnitude (particularly in the negative case).  If your
theory motivates use of this measure, you should be very careful to choose a
decay parameter on a non-ad hoc basis.

For directed networks, the Bonacich power measure can be understood as
similar to status in the network where higher status nodes have more edges
that point from them to others with status. Node A's centrality depends
on the centrality of all the nodes that A points toward, and their centrality
depends on the nodes they point toward, etc. Note, this means that a node
with an out-degree of 0 will have a Bonacich power centrality of 0 as they
do not point towards anyone. When using this with directed network it
is important to think about the edge direction and what it represents.
}
\note{
This function was ported (i.e. copied) from the SNA package.
}
\section{Warning }{
 Singular adjacency matrices cause no end of headaches for
this algorithm; thus, the routine may fail in certain cases.  This will be
fixed when we get a better algorithm.
}

\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
}

\examples{

# Generate some test data from Bonacich, 1987:
g.c <- make_graph(c(1, 2, 1, 3, 2, 4, 3, 5), dir = FALSE)
g.d <- make_graph(c(1, 2, 1, 3, 1, 4, 2, 5, 3, 6, 4, 7), dir = FALSE)
g.e <- make_graph(c(1, 2, 1, 3, 1, 4, 2, 5, 2, 6, 3, 7, 3, 8, 4, 9, 4, 10), dir = FALSE)
g.f <- make_graph(
  c(1, 2, 1, 3, 1, 4, 2, 5, 2, 6, 2, 7, 3, 8, 3, 9, 3, 10, 4, 11, 4, 12, 4, 13),
  dir = FALSE
)
# Compute power centrality scores
for (e in seq(-0.5, .5, by = 0.1)) {
  print(round(power_centrality(g.c, exp = e)[c(1, 2, 4)], 2))
}

for (e in seq(-0.4, .4, by = 0.1)) {
  print(round(power_centrality(g.d, exp = e)[c(1, 2, 5)], 2))
}

for (e in seq(-0.4, .4, by = 0.1)) {
  print(round(power_centrality(g.e, exp = e)[c(1, 2, 5)], 2))
}

for (e in seq(-0.4, .4, by = 0.1)) {
  print(round(power_centrality(g.f, exp = e)[c(1, 2, 5)], 2))
}

}
\references{
Bonacich, P.  (1972).  ``Factoring and Weighting Approaches to
Status Scores and Clique Identification.'' \emph{Journal of Mathematical
Sociology}, 2, 113-120.

Bonacich, P.  (1987).  ``Power and Centrality: A Family of Measures.''
\emph{American Journal of Sociology}, 92, 1170-1182.
}
\seealso{
\code{\link[=eigen_centrality]{eigen_centrality()}} and \code{\link[=alpha_centrality]{alpha_centrality()}}

Centrality measures
\code{\link{alpha_centrality}()},
\code{\link{authority_score}()},
\code{\link{betweenness}()},
\code{\link{closeness}()},
\code{\link{diversity}()},
\code{\link{eigen_centrality}()},
\code{\link{harmonic_centrality}()},
\code{\link{hits_scores}()},
\code{\link{page_rank}()},
\code{\link{spectrum}()},
\code{\link{strength}()},
\code{\link{subgraph_centrality}()}
}
\author{
Carter T. Butts
(\url{https://www.faculty.uci.edu/profile.cfm?faculty_id=5057}), ported to
igraph by Gabor Csardi \email{csardi.gabor@gmail.com}
}
\concept{centrality}
\keyword{graphs}
