Consider the intersection of two spaces: the complete solution space to Ax = b and the N-simplex. The intersection of these two spaces is a non-negative convex polytope. The package walkr samples from this intersection using two Monte-Carlo Markov Chain (MCMC) methods: hit-and-run and Dikin walk. walkr also provide tools to examine sample quality. The package implements Dikin walk specified in Sachdeva (2016) <doi:10.1016/j.orl.2016.07.005>.
Version: | 0.4.0 |
Depends: | R (≥ 3.1) |
Imports: | hitandrun, limSolve, MASS, Rcpp (≥ 0.11.6), shinystan |
LinkingTo: | Rcpp, RcppEigen |
Suggests: | testthat, knitr, grid, gridExtra, rmarkdown |
Published: | 2019-06-29 |
Author: | Andy Yao [aut, cre], David Kane [aut], Jeffrey Enos [aut] |
Maintainer: | Andy Yao <andy.yao17 at gmail.com> |
BugReports: | https://github.com/andyyao95/walkr/issues |
License: | GPL-3 |
URL: | https://github.com/andyyao95/walkr |
NeedsCompilation: | yes |
Citation: | walkr citation info |
Materials: | NEWS |
CRAN checks: | walkr results |
Reference manual: | walkr.pdf |
Vignettes: |
walkr |
Package source: | walkr_0.4.0.tar.gz |
Windows binaries: | r-devel: not available, r-release: not available, r-oldrel: walkr_0.4.0.zip |
OS X binaries: | r-release: walkr_0.4.0.tgz, r-oldrel: walkr_0.4.0.tgz |
Old sources: | walkr archive |
Please use the canonical form https://CRAN.R-project.org/package=walkr to link to this page.