Use this if you are using igraph from R
power_centrality
takes a graph (dat
) and returns the Boncich power
centralities of positions (selected by nodes
). The decay rate for
power contributions is specified by exponent
(1 by default).
power_centrality(graph, nodes = V(graph), loops = FALSE, exponent = 1, rescale = FALSE, tol = 1e07, sparse = TRUE)
graph 
the input graph. 
nodes 
vertex sequence indicating which vertices are to be included in the calculation. By default, all vertices are included. 
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. 
exponent 
exponent (decay rate) for the Bonacich power centrality score; can be negative 
rescale 
if true, centrality scores are rescaled such that they sum to 1. 
tol 
tolerance for nearsingularities during matrix inversion (see

sparse 
Logical scalar, whether to use sparse matrices for the calculation. The ‘Matrix’ package is required for sparse matrix support 
Bonacich's power centrality measure is defined by
C_BP(alpha,beta)=alpha
(Ibeta A)^1 A 1, where beta is an attenuation parameter (set
here by exponent
) and A is the graph adjacency
matrix. (The coefficient 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
beta>1/lambda_A1beta>1/lambda_A1 (the reciprocal of the largest
eigenvalue of A), this is to within a constant multiple of
the familiar eigenvector centrality score; for other values of β,
the behavior of the measure is quite different. In particular, β
gives positive and negative weight to even and odd walks, respectively, as
can be seen from the series expansion
C_BP(alpha,beta) = alpha sum( beta^k A^(k+1) 1, k in 0..infinity )C_BP(alpha,beta) = alpha sum( beta^k A^(k+1) 1,
k in 0..infinity ) which converges so long as beta<1/lambda_A1beta<1/lambda_A1.
The magnitude of 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 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 nonad hoc basis.
A vector, containing the centrality scores.
Singular adjacency matrices cause no end of headaches for
this algorithm; thus, the routine may fail in certain cases. This will be
fixed when I get a better algorithm. power_centrality
will not symmetrize your
data before extracting eigenvectors; don't send this routine asymmetric
matrices unless you really mean to do so.
This function was ported (ie. copied) from the SNA package.
Carter T. Butts (http://www.faculty.uci.edu/profile.cfm?faculty_id=5057), ported to igraph by Gabor Csardi csardi.gabor@gmail.com
Bonacich, P. (1972). “Factoring and Weighting Approaches to Status Scores and Clique Identification.” Journal of Mathematical Sociology, 2, 113120.
Bonacich, P. (1987). “Power and Centrality: A Family of Measures.” American Journal of Sociology, 92, 11701182.
eigen_centrality
and alpha_centrality
# Generate some test data from Bonacich, 1987: g.c < graph( c(1,2,1,3,2,4,3,5), dir=FALSE) g.d < graph( c(1,2,1,3,1,4,2,5,3,6,4,7), dir=FALSE) g.e < graph( c(1,2,1,3,1,4,2,5,2,6,3,7,3,8,4,9,4,10), dir=FALSE) g.f < 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)) }