bitriad
0.4Triadic Analysis of Affiliation Networks
Overview
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'.
Install
Health
- OK2026-07-016 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Downloads
Repository stars, issues, and contributor activity are not tracked yet.
Dependencies
Nothing depends on this yet.
Code
Code & tests
Open call graph →Line coverage
–
Expression
–
Tests / Examples
–
Functions
225 124 exported
Complexity
2.5 avg / 20 max
Call network
225 nodes / 265 edges
Test coverage has not been measured for this package yet; nodes fall back to a neutral fill.
Lowest coverage
Per-function coverage is not measured for this package yet.
People & History
1 releases. Pick two to compare their code metrics; R releases are shown for context.
- 0.4Latest2026-07-01 · current release
Package metadata
- First published
- 2026-07-01
- Total releases
- 1 / 1 yrs
- License
- GPL-2 OSI
- Download size
- not tracked yet
- Installed size
- not tracked yet
- With dependencies
- not tracked yet