> Which algorithm do you use to compute transitivity? It is a simple exhaustive search, nothing fancy. Starting from the node with the highest degree, the algorithm simply takes each node and considers it as a "middle" node in a 2-path, then enumerates all possible neighbor pairs of the node to find the "first" and "last" nodes in the 2-path. For each such pair, the denominator is increased. If the "first" and the "last" nodes are connected, the numerator is also increased. The result then follows from a simple division.
Best, Tamas _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
