Package: crossrun 0.1.1
crossrun: Joint Distribution of Number of Crossings and Longest Run
Joint distribution of number of crossings and the longest run in a series of independent Bernoulli trials. The computations uses an iterative procedure where computations are based on results from shorter series. The procedure conditions on the start value and partitions by further conditioning on the position of the first crossing (or none).
Authors:
crossrun_0.1.1.tar.gz
crossrun_0.1.1.zip(r-4.7-any)crossrun_0.1.1.zip(r-4.6-any)crossrun_0.1.1.zip(r-4.5-any)
crossrun_0.1.1.tgz(r-4.6-any)crossrun_0.1.1.tgz(r-4.5-any)
crossrun_0.1.1.tar.gz(r-4.7-any)crossrun_0.1.1.tar.gz(r-4.6-any)
crossrun_0.1.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION
card.svg |card.png
crossrun/json (API)
| # Install 'crossrun' in R: |
| install.packages('crossrun', repos = c('https://torewentzel-larsen.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/torewentzel-larsen/crossrun/issues
- joint100.6 - Joint probabilities, n=100, success probability 0.6
- joint100symm - Joint probabilities, n=100, symmetric case
- joint14.6 - Joint probabilities, n=14, success probability 0.6
- joint14em - Joint probabilities, n=14, around the empirical median
- joint14symm - Joint probabilities, n=14, symmetric case
- joint60.6 - Joint probabilities, 60, success probability 0.6
- joint60em - Joint probabilities, n=60, around the empirical median
- joint60symm - Joint probabilities, n=60, symmetric case
Last updated from:025e990193. Checks:9 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel | OK | 116 | ||
| source / vignettes | OK | 222 | ||
| linux-release | OK | 110 | ||
| macos-release | OK | 195 | ||
| macos-oldrel | OK | 161 | ||
| windows-devel | OK | 53 | ||
| windows-release | OK | 76 | ||
| windows-oldrel | OK | 75 | ||
| wasm-release | OK | 108 |
Exports:boxprobtclshiftcrossrunautocrossrunbincrossrunchangecrossrunemcrossrunshiftcrossrunsymmcumsummcumsummcolexactbinsimclbinsimclem