igraph (version 0.3.2)

transitivity: Transitivity of a graph

Description

Transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient.

Usage

transitivity(graph, type="undirected", vids=V(graph))

Arguments

graph

The graph to analyze.

type

The type of the transitivity to calculate. Possible values:

• global

{The global transitivity of an undirected graph (directed graphs are considered as undirected ones as well). This is simply the ratio of the triangl

Value

• 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.

item

vids

References

Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.

Examples

g <- graph.ring(10)
transitivity(g)
g2 <- erdos.renyi.game(1000, 10/1000)
transitivity(g2)   # this is about 10/1000