Installation
About
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)
Citation | gretel citation info |
github.com/davidbuch/gretel | |
Bug report | File report |
Key Metrics
Downloads
Yesterday | 3 0% |
Last 7 days | 26 +4% |
Last 30 days | 129 -15% |
Last 90 days | 406 -6% |
Last 365 days | 1.806 -7% |
Maintainer
Maintainer | David Buch |