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="undirected")
graph |
The graph to analyze. |
type |
The type of the transitivity to calculate. Possible
values: ‘undirected ’ calculates the global transitivity of an
undirected graph (directed graphs are considered as undirected ones
as well). This is simply the ratio of the triangles and the
connected triples in the graph.
|
For ‘undirected
’ a single number, or NaN
if there are no
connected triples in the graph.
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