## Are triangles made up by strong ties?

A key assumption of Granovetter’s (1973) Strength of Weak Ties theory is that strong ties are embedded by being part of triangles, whereas weak ties are not embedded by being created towards disconnected nodes. This assumption have been tested by calculating the traditional clustering coefficient on binary networks created with increasing cut-off parameters (i.e., creating a series of binary networks from a weighted network where ties with a weight greater than a cut-off parameter is set to present and the rest removed). Contrarily to theories of strong ties and embeddedness, these methods generally showed that the clustering coefficient decreased as the cut-off parameter increased. However, the binary networks were not comparable with each other as they had a different number of ties. Another way of testing this assumption is to take the ratio between the weighted global clustering coefficient and the traditional coefficient measured on networks where all ties are considered present. Thus, the number of ties is maintained. This post highlights this feature and empirically tests it on a number of publically available weighted network datasets.

*tnet*manual, see Clustering.

*Related*

Entry filed under: Network thoughts. Tags: arcs, clustering coefficient, complex networks, edges, embeddedness, graphs, Links, network, social network analysis, strength of ties, ties, valued networks, weighted networks.

Article: Clustering in Weighted Networks Projecting two-mode networks onto weighted one-mode networks