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 highorder connections overlooked in primitive adjacency sociomatrices. Novel methods are described in Buch (2019) <https://davidbuch.github.io/analyzingnetworkswithgretel.html>. More traditional methods are also implemented, as described in Yang, Knoke (2001) <doi:10.1016/S03788733(01)000430>.
Package details 


Author  David Buch [aut, cre] (<https://orcid.org/0000000245740075>) 
Maintainer  David Buch <[email protected]> 
License  GPL3 
Version  0.0.1 
URL  https://github.com/davidbuch/gretel 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.