Transitivity of a graph
Transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient.
- The graph to analyze.
- The type of the transitivity to calculate. Possible
calculates the global transitivity of an undirected graph (directed graphs are considered as undirected ones as well). This is simply the rati
a single number, or
NaNif there are no connected triples in the graph.
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