Calculate transitivity for an undirected graph
Calculate transitivity for an undirected graph
transitivity(g)
g |
an instance of the |
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.
Transitivity for graph g.
Li Long li.long@isb-sib.ch
Approximating Clustering Coefficient and Transitivity, T. Schank, D. Wagner, Journal of Graph Algorithms and Applications, Vol. 9, No. 2 (2005).
clusteringCoef, clusteringCoefAppr, graphGenerator
con <- file(system.file("XML/conn.gxl",package="RBGL"))
g <- fromGXL(con)
close(con)
tc <- transitivity(g)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.