Nothing
walkr: Random Walks in the Intersection of Hyperplanes and the N-Simplex
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>.
Browse package contents
Package details |
|
|---|---|
| Author | Andy Yao [aut, cre], David Kane [aut], Jeffrey Enos [aut] |
| Maintainer | Andy Yao <andy.yao17@gmail.com> |
| License | GPL-3 |
| Version | 0.4.0 |
| URL | https://github.com/andyyao95/walkr |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the walkr package in your browser
Any scripts or data that you put into this service are public.
