gretel
Generalized Path Analysis for Social Networks
The social network literature features numerous methods for assigning value to paths as a function of their ties. 'gretel' systemizes these approaches, casting them as instances of a generalized path value function indexed by a penalty parameter. The package also calculates probabilistic path value and identifies optimal paths in either value framework. Finally, proximity matrices can be generated in these frameworks that capture high-order connections overlooked in primitive adjacency sociomatrices. Novel methods are described in Buch (2019) <https://davidbuch.github.io/analyzing-networks-with-gretel.html>. More traditional methods are also implemented, as described in Yang, Knoke (2001) <doi:10.1016/S0378-8733(01)00043-0>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.0.1 |
rolling source/ R- | gretel_0.0.1.tar.gz |
31.8 KiB |
0.0.1 |
rolling linux/jammy R-4.5 | gretel_0.0.1.tar.gz |
102.9 KiB |
0.0.1 |
rolling linux/noble R-4.5 | gretel_0.0.1.tar.gz |
103.6 KiB |
0.0.1 |
latest source/ R- | gretel_0.0.1.tar.gz |
31.8 KiB |
0.0.1 |
latest linux/jammy R-4.5 | gretel_0.0.1.tar.gz |
102.9 KiB |
0.0.1 |
latest linux/noble R-4.5 | gretel_0.0.1.tar.gz |
103.6 KiB |
0.0.1 |
2026-04-23 source/ R- | gretel_0.0.1.tar.gz |
31.8 KiB |
0.0.1 |
2026-04-09 windows/windows R-4.5 | gretel_0.0.1.zip |
429.6 KiB |
0.0.1 |
2025-04-20 source/ R- | gretel_0.0.1.tar.gz |
31.8 KiB |