walkr

walkr: MCMC Sampling from Non-Negative Convex Polytopes - Published in JOSS (2017)

https://github.com/andyyao95/walkr

Science Score: 95.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
    Found 1 DOI reference(s) in JOSS metadata
  • Academic publication links
  • Committers with academic emails
    3 of 7 committers (42.9%) from academic institutions
  • Institutional organization owner
  • JOSS paper metadata
    Published in Journal of Open Source Software
Last synced: 6 months ago · JSON representation

Repository

This package implements MCMC random walks in the intersection of the n-simplex and hyperplanes

Basic Info
  • Host: GitHub
  • Owner: andyyao95
  • Language: R
  • Default Branch: master
  • Size: 6.99 MB
Statistics
  • Stars: 11
  • Watchers: 7
  • Forks: 4
  • Open Issues: 3
  • Releases: 2
Created over 10 years ago · Last pushed over 6 years ago
Metadata Files
Readme

README.md

walkr

CRAN status Build status Codecov test coverage

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 convex polytope. 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.

Getting Started

  • Install from CRAN(released version):

install.packages("walkr")

  • Install from GitHub (development version):

devtools::install_github("andyyao95/walkr")

Sampling Points

library(walkr) A <- matrix(1, ncol = 3) b <- 1 sampled_points <- walkr(A = A, b = b, points = 1000, method = "dikin", ret.format = "list")

Visualizing the Sampled Points

explore_walkr(sampled_points)

Owner

  • Name: Andy Yao
  • Login: andyyao95
  • Kind: user
  • Company: Williams College

JOSS Publication

walkr: MCMC Sampling from Non-Negative Convex Polytopes
Published
March 20, 2017
Volume 2, Issue 11, Page 61
Authors
Andy Yu Zhu Yao ORCID
Williams College
David Kane
IQSS, Harvard University
Editor
Karthik Ram ORCID
Tags
Monte Carlo Markov Chain sampling random walks convex polytope

GitHub Events

Total
Last Year

Committers

Last synced: 7 months ago

All Time
  • Total Commits: 227
  • Total Committers: 7
  • Avg Commits per committer: 32.429
  • Development Distribution Score (DDS): 0.308
Past Year
  • Commits: 0
  • Committers: 0
  • Avg Commits per committer: 0.0
  • Development Distribution Score (DDS): 0.0
Top Committers
Name Email Commits
Andy Yu Zhu Yao a****3@w****u 157
David Kane d****e@g****m 33
Yuanchu Y****g@w****u 30
Karan Tibrewal k****3@w****u 2
Arfon Smith a****n 2
David Kane d****e@h****l 2
Jeffrey Enos j****s@g****m 1
Committer Domains (Top 20 + Academic)

Issues and Pull Requests

Last synced: 6 months ago

All Time
  • Total issues: 4
  • Total pull requests: 4
  • Average time to close issues: about 5 hours
  • Average time to close pull requests: 7 days
  • Total issue authors: 3
  • Total pull request authors: 3
  • Average comments per issue: 1.0
  • Average comments per pull request: 0.0
  • Merged pull requests: 2
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Top Authors
Issue Authors
  • jluby (2)
  • justinwhite (1)
  • dgrtwo (1)
Pull Request Authors
  • jluby (2)
  • arfon (1)
  • jeffreyenos (1)
Top Labels
Issue Labels
Pull Request Labels

Dependencies

DESCRIPTION cran
  • R >= 3.1 depends
  • ggplot2 * depends
  • MASS * imports
  • Rcpp >= 0.11.6 imports
  • hitandrun * imports
  • limSolve * imports
  • shinystan * imports
  • grid * suggests
  • gridExtra * suggests
  • knitr * suggests
  • testthat * suggests