prestige
takes one or more graphs (dat
) and returns the prestige scores of positions (selected by nodes
) within the graphs indicated by g
. Depending on the specified mode, prestige based on any one of a number of different definitions will be returned. This function is compatible with centralization
, and will return the theoretical maximum absolute deviation (from maximum) conditional on size (which is used by centralization
to normalize the observed centralization score).
prestige(dat, g=1, nodes=NULL, gmode="digraph", diag=FALSE, cmode="indegree", tmaxdev=FALSE, rescale=FALSE, tol=1e-07)
g==1
. gmode
is set to "digraph" by default.diag
is FALSE
by default. tmaxdev==FALSE
. Note that the centralization of prestige is simply the extent to which one actor has substantially greater prestige than others; the underlying definition is the same.
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
centralization
g<-rgraph(10) #Draw a random graph with 10 members
prestige(g,cmode="domain") #Compute domain prestige scores
Run the code above in your browser using DataLab