similar to: qbinom (PR#13711)

Displaying 20 results from an estimated 1000 matches similar to: "qbinom (PR#13711)"

2005 Nov 23
1
qbinom returns NaN
Hi, All: For most but not all cases, qbinom is the inverse of pbinom. Consider the following example, which generates an exception: > (pb01 <- pbinom(0:1, 1, .5, log=T, lower.tail=FALSE)) [1] -0.6931472 -Inf Since "lower.tail=FALSE", Pr{X>1} = 0 in this context, and log(0) = -Inf, consistent with the documentation. However, the inverse of this does NOT
2000 Apr 07
4
Bug in qbinom? (PR#511)
n_10;p_0.5;jjx_0:n;qbinom(pbinom(jjx,n,p),n,p) # This one works as expected n_100;p_0.5;jjx_0:n;qbinom(pbinom(jjx,n,p),n,p) # This one causes severe problems I cannot interrupt using ESC and I finally have to resort to the Windows Task manager to kill the R session. A friend of mine told me that he faced similar problems under Unix. --please do not edit the information below-- Version:
2007 Jun 28
2
inaccuracy in qbinom with partial argument matching
Hi, I found the following strange effect with qbinom & partial argument matching p0 <- pbinom(0, size = 3, prob = 0.25) qbinom(p0, size = 3, prob = 0.25) ## 0 o.k. qbinom(p0-0.05, size = 3, prob = 0.25) ## 0 o.k. ## positional matching: qbinom(p0, 3, 0.25) ## 0 o.k. ## partial argument matching: qbinom(p0 , s = 3, p = 0.25) ## 1 ??? qbinom(p0-0.05,
2020 Aug 10
2
qnbinom with small size is slow
Thanks Ben for verifying the issue. It is always reassuring to hear when others can reproduce the problem. I wrote a small patch that fixes the issue (https://github.com/r-devel/r-svn/pull/11): diff --git a/src/nmath/qnbinom.c b/src/nmath/qnbinom.c index b313ce56b2..d2e8d98759 100644 --- a/src/nmath/qnbinom.c +++ b/src/nmath/qnbinom.c @@ -104,6 +104,7 @@ double qnbinom(double p, double size,
2008 Aug 21
1
pnmath compilation failure; dylib issue?
(1) ...need to speed up a monte-carlo sampling...any suggestions about how I can get R to use all 8 cores of a mac pro would be most useful and very appreciated... (2) spent the last few hours trying to get pnmath to compile under os- x 10.5.4... using gcc version 4.2.1 (Apple Inc. build 5553) as downloaded from CRAN, xcode 3.0... ...xcode 3.1 installed over top of above after
2012 Nov 30
4
qbinom
a=c(0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9) b=c(0.9, 0.8, 0.7, 0.6, 0.5, 0.4, 0.3, 0.2, 0.1) cor(a,b)= -1 a'=qbinom(a, 1, 0.5) b'=qbinom(b, 1, 0.5) why cor(a',b') becomes -0.5 ? -- View this message in context: http://r.789695.n4.nabble.com/qbinom-tp4651460.html Sent from the R help mailing list archive at Nabble.com.
2009 Mar 17
3
R does not compile any more on FreeBSD 8.0-CURRENT
On a recent FreeBSD 8.0-CURRENT (i386) building R (any version) breaks with the following messages: ---------------------------------------------------------------------- [...snip...] gcc -std=gnu99 -I. -I../../src/include -I../../src/include -I/usr/local/include -DHAVE_CONFIG_H -g -O2 -c wilcox.c -o wilcox.o gcc -std=gnu99 -I. -I../../src/include -I../../src/include -I/usr/local/include
2003 Dec 18
1
qbinom when probability is 1 (PR#5900)
Full_Name: Jonathan Swinton Version: 1.8.0 OS: Windows 2000 Submission from: (NULL) (193.132.159.34) Calling qbinom with a sample probability of 1 returns NaN > qbinom(p=0.95,size=10,prob=1) [1] NaN I believe that this is wrong and that qbinom(p,size,prob=1) should always be size for 0<p<=1. The documentation says that The quantile is defined as the smallest value x such that F(x)
2004 Jun 11
1
qbinom(p, size, prob = 0, lower.tail = FALSE) hangs (PR#6972)
Full_Name: Jon McAuliffe Version: 1.9.0 OS: Mac OS X 10.3.4 Submission from: (NULL) (64.166.16.252) a call like qbinom(0.3, 10, prob = 0, lower.tail = FALSE) hangs R. prob = 0 does not look interesting, but it can be useful for completeness when qbinom is part of other general routines. please see PR#5900 (Accuracy-fixed). jon. --please do not edit the information below-- Version:
2020 Aug 21
1
qnbinom with small size is slow
Hi Martin, thanks for verifying. I agree that the Cornish-Fisher seems to struggle with the small size parameters, but I also don't have a good idea how to replace it. But I think fixing do_search() is possible: I think the problem is that when searching to the left y is decremented only if `pnbinom(y - incr, n, pr, /*l._t.*/TRUE, /*log_p*/FALSE)) < p` is FALSE. I think the solution is
2012 May 31
1
inverse binomial in R
Hello! I'm having some trouble  trying to replicate in R a Stata function  invbinomial(n,k,p)        Domain n:     1 to 1e+17        Domain k:     0 to n - 1        Domain p:     0 to 1 (exclusive)        Range:        0 to 1        Description:  returns the inverse of the cumulative binomial; i.e., it                          returns the probability of success on one trial such              
2003 Sep 27
2
CI on median
Dear friends, I'm probably wrong but is there anything better than bootstrap to get a confidence interval of the median from a population with unspecified distribution ? Best wishes Troels Ring, Aalborg, Denmark
1997 Jul 09
1
R-beta: Problem with `rpois'
There is a problem with `rpois'. It does seem to take care about the order of the arguments. This is an example: > rpois(n=1,lambda=2) [1] 3 > rpois(lambda=2,n=1) [1] 2 0 It obviously uses the first argument as the number of samples to be drawn, which is wrong. I used Version 0.49 Beta (April 23, 1997). Fredrik
1997 Jul 09
1
R-beta: Problem with `rpois'
There is a problem with `rpois'. It does seem to take care about the order of the arguments. This is an example: > rpois(n=1,lambda=2) [1] 3 > rpois(lambda=2,n=1) [1] 2 0 It obviously uses the first argument as the number of samples to be drawn, which is wrong. I used Version 0.49 Beta (April 23, 1997). Fredrik
2003 Jan 22
2
small bug in binom.test?
Hi all, I am wondering whether there is a small bug in the binom.test function of the ctest library (I'm using R 1.6.0 on windows 2000, but Splus 2000 seems to have the same behaviour). Or perhaps I've misunderstood something. the command binom.test(11,100,p=0.1) and binom.test(9,100,p=0.1) give different p-values (see below). As 9 and 11 are equidistant from 10, the mean of the
2020 Aug 07
2
qnbinom with small size is slow
Hi all, I recently noticed that `qnbinom()` can take a long time to calculate a result if the `size` argument is very small. For example qnbinom(0.5, mu = 3, size = 1e-10) takes ~30 seconds on my computer. I used gdb to step through the qnbinom.c implementation and noticed that in line 106 (https://github.com/wch/r-source/blob/f8d4d7d48051860cc695b99db9be9cf439aee743/src/nmath/qnbinom.c#L106)
2018 Feb 09
1
R Compilation gets stuck on Windows 64
Please note that building R on Windows is documented in "R Installation and Administration", including links to external software. Particularly there is a link to texinfo which is part of Rtools. The documentation is maintained and it is a sufficient source of information for building R on Windows. https://cran.r-project.org/doc/manuals/r-release/R-admin.html
2002 Mar 12
1
rbinom silently rounds size argument (PR#1377)
rbinom (in R-1.4.1) silently rounds its "size" argument. The C code contains n = floor(nin + 0.5); I would argue that this should this either be documented or changed (to return NA). (The behavior is inconsistent with dbinom). I sent this in to the devel list a couple of weeks ago to provoke discussion; no disagreement (or agreement) so I'm submitting it as a bug.
2000 Nov 16
2
newbee question
Dear All Where can I lookup good methods to compute p from q=bin(m,n)p^n*(1-p)^(m-n) such that q<=alfa, alfa small. Are there such libs, code and source in R? Best Regards -- Jan Burse SIAM, EAWAG Scheuchzerstr. 67 ?berlandstr. 133 8006 Z?rich 8600 D?bendorf tel: +41-1-364 17 66 tel: +41-1-823 55 34
2011 Nov 01
1
Sample size calculations for one sided binomial exact test
I'm trying to compute sample size requirements for a binomial exact test. we want to show that the proportion is at least 90% assuming that it is 95%, with 80% power so any asymptotic approximations are out of the questions. I was planning on using binom.test to perform the simple test against a prespecified value, but cannot find any functions for computing sample size. do any exist?