Triad Census on Random Graphs

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The sixteen isomorphic triads are sometimes called the building blocks, periodic table, or even DNA of social networks. Structural balance theories posit that in social networks, some triads should occur much more or much less often than expected by chance. This Demonstration illustrates the expected frequencies in which these triads occur in random graphs of varying density. You can repeatedly generate networks with the same parameters. The census history should eventually converge to the expected frequency.

Contributed by: Philip S. Lu (October 2011)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.