transitivity {igraph} | R Documentation |
Transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient.
transitivity(graph, type=c("undirected", "global", "globalundirected", "localundirected", "local", "average", "localaverage", "localaverageundirected"), vids=NULL)
graph |
The graph to analyze. |
type |
The type of the transitivity to calculate. Possible
values:
|
vids |
The vertex ids for the local transitivity will be
calculated. This will be ignored for global transitivity types.
The default value is NULL , in this case all vertices are
considered. It is slightly faster to supply NULL here than
V(graph) .
|
For ‘global
’ a single number, or NaN
if there are no
connected triples in the graph.
For ‘local
’ a vector of transitivity scores, one for
each vertex in ‘vids
’.
Gabor Csardi csardi@rmki.kfki.hu
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
g <- graph.ring(10) transitivity(g) g2 <- erdos.renyi.game(1000, 10/1000) transitivity(g2) # this is about 10/1000