bitriad

MaRDI QIDQ7375768CRANFDO

Authors Jason Cory Brunson

Last update 30 June 2026

Copyright license GNU General Public License, version 2.0

Software version identifier 0.4

Description

Two principal tools are provided for the triadic analysis of affiliation networks: triad census and triadic closure. These include several variations on both classical tools tailored to affiliation network structure; see Opsahl (2013) <doi:10.1016/j.socnet.2011.07.001>, Liebig and Rao (2014) <doi:10.1109/SITIS.2014.15>, and Brunson (2015) <doi:10.1017/nws.2015.38>. Additional functions support manipulation of affiliation networks. Built on 'igraph' with new C++ calculations exposed via 'Rcpp'.

Cites work

• Identifying Influential Nodes in Bipartite Networks Using the Clustering Coefficient
• Triadic analysis of affiliation networks
• Triadic closure in two-mode networks: Redefining the global and local clustering coefficients

This page was built for software: bitriad