Tom Davot

Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time

A graph G is c-closed if every two vertices with at least c common neighbors are adjacent to each other. This definition is an abstraction of the triadic closure property exhibited by many real-world social networks, namely, friends of friends tend to be friends themselves. Social networks, however,…