plot.equiv.clust | R Documentation |
Plots a hierarchical clustering of node positions as generated by equiv.clust
.
## S3 method for class 'equiv.clust'
plot(x, labels=NULL, ...)
x |
An |
labels |
A vector of vertex labels |
... |
Additional arguments to |
plot.equiv.clust
is actually a front-end to plot.hclust
; see the latter for more additional documentation.
None.
Carter T. Butts buttsc@uci.edu
Breiger, R.L.; Boorman, S.A.; and Arabie, P. (1975). “An Algorithm for Clustering Relational Data with Applications to Social Network Analysis and Comparison with Multidimensional Scaling.” Journal of Mathematical Psychology, 12, 328-383.
Burt, R.S. (1976). “Positions in Networks.” Social Forces, 55, 93-122.
Wasserman, S., and Faust, K. Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
equiv.clust
, plot.hclust
#Create a random graph with _some_ edge structure
g.p<-sapply(runif(20,0,1),rep,20) #Create a matrix of edge
#probabilities
g<-rgraph(20,tprob=g.p) #Draw from a Bernoulli graph
#distribution
#Cluster based on structural equivalence
eq<-equiv.clust(g)
plot(eq)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.