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) <>. More traditional methods are also implemented, as described in Yang, Knoke (2001) <doi:10.1016/S0378-8733(01)00043-0>.

Version: 0.0.1
Depends: R (≥ 3.0)
Imports: Rcpp (≥ 1.0.0), ResistorArray (≥ 1.0-32)
LinkingTo: Rcpp
Suggests: knitr, rmarkdown, testthat (≥ 2.1.0)
Published: 2019-08-22
DOI: 10.32614/CRAN.package.gretel
Author: David Buch ORCID iD [aut, cre]
Maintainer: David Buch <davidbuch42 at>
License: GPL-3
NeedsCompilation: yes
Citation: gretel citation info
Materials: README NEWS
CRAN checks: gretel results


Reference manual: gretel.pdf
Vignettes: Analyzing Networks with gretel


Package source: gretel_0.0.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): gretel_0.0.1.tgz, r-oldrel (arm64): gretel_0.0.1.tgz, r-release (x86_64): gretel_0.0.1.tgz, r-oldrel (x86_64): gretel_0.0.1.tgz


Please use the canonical form to link to this page.