Dyads, triads, and tetrads: a multivariate simulation approach to uncovering network motifs in social graphs

Abstract Motifs represent local subgraphs that are overrepresented in networks. Several disciplines document multiple instances in which motifs appear in graphs and provide insight into the structure and processes of these networks. In the current paper, we focus on social networks and examine the prevalence of dyad, triad, and symmetric tetrad motifs among 24 networks that represent six types of social interactions: friendship, legislative co-sponsorship, Twitter messages, advice seeking, email communication, and terrorist collusion. Given that the correct control distribution for detecting motifs is a matter of continuous debate, we propose a novel approach that compares the local patterns of observed networks to random graphs simulated from exponential random graph models. Our proposed technique can produce conditional distributions that control for multiple, lower-level structural patterns simultaneously. We find evidence for five motifs using our approach, including the reciprocated dyad, three triads, and one symmetric tetrad. Results highlight the importance of mutuality, hierarchy, and clustering across multiple social interactions, and provide evidence of “structural signatures” within different genres of graph. Similarities also emerge between our findings and those in other disciplines, such as the preponderance of transitive triads.
  • Diane Felmlee (PSU)
  • Cassie McMillan (PSU)
  • Roger Whitaker (Cardiff)
Date Aug-2021
Venue Applied Network Science volume 6, Article number: 63 (2021)