Triad Census on Random Graphs

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.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.