similar to: pbinom( ) function (PR#8700)

Full_Name: Chanseok Park Version: 1.8.1 OS: linux-gnu Submission from: (NULL) (130.127.112.183) digamma with any negative value does not give a right answer. It gives -1.797693e+308 for any negative arguments. For example, digamma(-1.1) gives -1.797693e+308. The right answer should be 10.15416 This bug can be easily fixed by using the following digamma identity. digamma(x) = digamma(1-x) -

(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

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

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

Full_Name: Uffe H?gsbro Thygesen Version: 2.2.0 OS: linux Submission from: (NULL) (130.226.135.250) Hello all. pbinom(q=0,size=0,prob=0.5) returns the value NaN. I had expected the result 1. In fact any value for q seems to give an NaN. Note that dbinom(x=0,size=0,prob=0.5) returns the value 1. Cheers, Uffe

Hi Folks, The recent correspondence about "strange fisher.test result", and especially Peter Dalgaard's reply on Tue 03 April 2007 (which I want to investigate further) led me to take a close look at the code for binom.test(). I now have a query! The code for the two-sided case computes the p-value as follows: if (p == 0) (x == 0) else if (p == 1) (x == n)

Hello all, I am trying to understand the different results I am getting from the following 3 commands: chisq.test(c(62,50), p = c(0.512,1-0.512), correct = F) # p-value = 0.3788 binom.test(x=62,n=112, p= 0.512) # p-value = 0.3961 2*(1-pbinom(62,112, .512)) # p-value = 0.329 Well, the binom.test was supposed to be "exact" and give the same results as the pbinom, while the chisq.test

This came up due to a question from Anders Hald: Bernoulli calculated an approximation to the smallest n so that P(0.58 <= x/n <= 0.62) >= 1000/1001 What is the exact value? Now try n <- 6350:6500 Pr <- function(n)pbinom(0.62*n,n,0.6) - pbinom(0.58*n,n,0.6) + dbinom(0.58*n,n,0.6) plot(n,Pr(n),type="b") abline(h=1000/1001) min(n[Pr(n)>1000/1001]) Next, try Pr

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

I was just curious if anyone knew of an alternative model to logistic regression where the probabilities seems pretty linear to the predictor rather than having that S shape that probit and logit assume. Maybe there is there some kind of other GLM that could accomplish that. Any textbook references or suggestions are appreciated. I have most of the texts but if someone knows of a text that talks

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:

On Feb 10, 2005, at 7:38 PM, George W. Gilchrist wrote: > Today I was running a graduate level stats lab using R and we > encountered a > major problem while using the current build of the Cocoa GUI: > >> From the GUI: >> system.time(pbinom(80, 1e5, 806/1e6)) > [1] 14.37 4.94 30.29 0.00 0.00 >> > >> From the command line on the same machine: >>

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

Dear friends. In Carlin and Louis "Bayes and emperical Bayes methods.." 1996 the classical example of 12 independent tosses of a fair coin producing 9 heads and 3 tails is given. If the situation is seen as a fixed sample of 12, a binomial lieklihood is used, and Carlin et al reports a probability of 0.075. Using sum(dbinom(9:12,12,.5)) I obtain 0.073 Likewise, if the experiment is

Dear list members, I have a series of /unequal/ probabilities [p1,p2,...,pk], describing mutually exclusive events, and a "remainder" class with a probability p0=1-p1-p2-....-pk, and need to calculate, for a given number of trials t>=k, the combined probability that each of the classes 1...k contains at least 1 "event" (the remainder class may be empty). To me this reaks

Btw, all the pbinom() examples posted to S-news today return the proper result in R Martin >>>>> "JS" == James Stapleton <stapleton at stt.msu.edu> writes to S-news : JS> More interesting behavior of pbinom: >> pbinom(3,2,.8) JS> [1] 1 >> pbinom(30,2,.8) JS> [1] 0.9967653 >> pbinom(40,2,.8) JS> [1]

Dear R users, I?m trying to optimize simultaneously two binomials inequalities (used in acceptance sampling) which are nonlinear solution, so there is no simple direct solution. Please, let me explain shortly the the problem and the question as following. The objective is to obtain the smallest value of 'n' (sample size) satisfying both inequalities: (1-alpha) <= pbinom(c, n, p1)

Hi Developers, The alpha, compiles successfully, but it is failing make check-all (on two seperate machines, both FreeBSD 6.1). Here is the version string: platform i386-unknown-freebsd6.1 arch i386 os freebsd6.1 system i386, freebsd6.1 status alpha major 2 minor 3.0 year 2006 month 03 day 27 svn rev

I am trying to find a definition for the two-tailed exact binomial test but have been unsuccessful. Can you help? --------------------------------- [[alternative HTML version deleted]]

The real problem is that pbeta can take forever. That's bug #7153 and a fix is within reach. Morten