Description Usage Arguments Details Value Note Author(s) References Examples
The PN centrality is a measure of centrality that takes into account the negative ties in a network
1 2 | pnCentrality(posit, negat)
pnCentrality_val(posit,negat,fac_beta=max(c(posit,negat))*2)
|
posit |
The adjacency matrix representing the positive relationships in a network. |
negat |
The adjacency matrix representing the negative relationships in a network. Note that the relationships have to be positive (1) in this matrix even though they represents the negative relationships |
The formula given for the PN centrality is
PN=(I-\frac{1}{2n-2}A)^{-1}*1
Returns a vector of PN centrality values (the length of the vector corresponds to the number of vertices)
The function for the valued networks is experimental and has not been tested sufficiently with classical example. Use at tour own risk!
Bottin, Marius
@articleEverett2014NetworksCN, title=Networks containing negative ties, author=Martin G. Everett and Stephen P. Borgatti, journal=Social Networks, year=2014, volume=38, pages=111-120
1 2 3 4 5 6 | data(mixedTie)
P<-N<-mixedTie
P[P<=0]<-0
N[N>=0]<-0
N<-abs(N)
pnCentrality(P,N)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.