The principle of triadic closure is that if two people in a social network have a friend in common, then there is an increased probability that they will become friends at some point in the future. For example, if there were three people within a network, A, B, and C, if A and B are friends, and B and C are friends, there is a high possibility that B and C are also friends. If each person were represented as a node, these 3 nodes combined would form a triadic closure.<\/p>\n
Clustering Coefficient <\/em><\/strong><\/p>\n Within graph theory, a clustering coefficient is the measure of the degree to which individual nodes within a graph cluster together. For example, the clustering coefficient of a node titled A, is the probability that two randomly selected friends of node A, are friends with each other. This is a social network metric used to measure the prevalence of triadic closure.<\/p>\n Written by Ashton Kingdon<\/p>\n","protected":false},"excerpt":{"rendered":" The principle of triadic closure is that if two people in a social network have a friend in common, then there is an increased probability that they will become friends at some point in the future. For example, if there were three people within a network, A, B, and C, if A and B are … <\/p>\n