gretel

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.

Last 30 days

This package has been downloaded 130 times in the last 30 days. More than a random curiosity, but not quite a blockbuster. Still, it's gaining traction! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 3 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 1,613 times in the last 365 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. The day with the most downloads was Sep 11, 2024 with 28 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.