transitivity
Calculate transitivity for an undirected graph
Calculate transitivity for an undirected graph
 Keywords
 models
Usage
transitivity(g)
Arguments
 g
 an instance of the
graph
class
Details
For an undirected graph G
, let delta(v) be the number of triangles with
v
as a node, let tau(v) be the number of triples, i.e., paths of length 2 with
v
as the center node.
Define transitivity T(G) = sum(delta(v)) / sum(tau(v)), for all v in V.
Value

Transitivity for graph
g
.
References
Approximating Clustering Coefficient and Transitivity, T. Schank, D. Wagner, Journal of Graph Algorithms and Applications, Vol. 9, No. 2 (2005).
See Also
clusteringCoef, clusteringCoefAppr, graphGenerator
Examples
con < file(system.file("XML/conn.gxl",package="RBGL"))
g < fromGXL(con)
close(con)
tc < transitivity(g)
Community examples
Looks like there are no examples yet.