Integer random number: comparison of two strategies

If you need an integer ransom number, here are two strategies. First get it from uniform distribution and take the integer part, second generate all integer possible values and take one randomly. The first solution is two times faster.
As seen in the last example, the manipulation of a vector of 50000 elements is not efficient at all.
However, if you know how many random numbers you will need, it is better to estimate first a long vector of random numbers and after get one per one.




1/ Using integer of uniform random number one by one: 1.994

> system.time(
+   for (i in 1:1000000)
+     a <- floor(runif(n = 1, min=1, max=50001))
+ )
utilisateur     système      écoulé 
      1.853       0.116       1.994

2/ Long vector of integer of uniform random number: 0.196

> system.time({+   ru <- floor(runif(n = 1000000, min=1, max=50001))
+   for (i in 1:1000000)
+     a <- ru[i]
+ }
+ )
utilisateur     système      écoulé 
      0.187       0.007       0.196 

3/ Take one random value from a long vector generated once: 4.529

> system.time(
+   {
+   serie <- 1:50000
+   for (i in 1:1000000)
+     a <- sample(x = serie, 1)
+   }
+ )
utilisateur     système      écoulé 
      4.427       0.041       4.529

4/ Generate long vector and randomize it: 0.147
The Winner !

> system.time({
+   ru <- sample(1:50000, 1000000, replace = TRUE)
+   for (i in 1:1000000)
+     a <- ru[i]
+ }
+ )
utilisateur     système      écoulé 
      0.139       0.008       0.147 

5/ Take one randomize value from a long vector generated many times: 143.988

> system.time(
+   {
+     for (i in 1:1000000)
+       a <- sample(x = 1:50000, 1)
+   }
+ )
utilisateur     système      écoulé 
     80.750      59.865     143.988 

Commentaires

Enregistrer un commentaire

Posts les plus consultés de ce blog

Standard error from Hessian Matrix... what can be done when problem occurs

An Hessian matrix is a square matrix of partial second order derivative. From the square-root of the inverse of the diagonal, it is possible to estimate the standard error of parameters. Let take an example: val=rnorm(100, mean=20, sd=5) # Return -ln L of values in val in Gaussian distribution with mean and sd in par fitnorm<-function(par, val) {   -sum(dnorm(val, par["mean"], par["sd"], log = TRUE)) } # Initial values for search p<-c(mean=20, sd=5) # fit the model result <- optim(par=p, fn=fitnorm, val=val, method="BFGS", hessian=TRUE) # Inverse the hessian matrix to get SE for each parameters mathessian <- result$hessian inversemathessian <- solve(mathessian) res <- sqrt(diag(inversemathessian)) # results data.frame(Mean=result$par, SE=res)   library(MASS) (r<-fitdistr(val, "normal")) It works well. However, the inverse of the matrix cannot be calculated if the second order derivative for some paramete
Lire la suite

Install treemix in ubuntu 20.04

Informations are available here  https://bitbucket.org/nygcresearch/treemix/downloads/ In terminal, enter for  Ubuntu 20.04: wget https://bitbucket.org/nygcresearch/treemix/downloads/treemix-1.13.tar.gz tar -xvf treemix-1.13.tar.gz sudo apt-get install libgsl-dev sudo apt install libboost-dev sudo apt install libboost-all-dev cd treemix-1.13/ ./configure make sudo make install And it works: $ treemix TreeMix v. 1.13 $Revision: 231 $ Options: -h display this help -i [file name] input file -o [stem] output stem (will be [stem].treeout.gz, [stem].cov.gz, [stem].modelcov.gz) -k [int] number of SNPs per block for estimation of covariance matrix (1) -global Do a round of global rearrangements after adding all populations -tf [file name] Read the tree topology from a file, rather than estimating it -m [int] number of migration edges to add (0) -root [string] comma-delimited list of populations to set on one side of the root (for migration) -g [vertices file name] [edges file name] read the g
Lire la suite

stepAIC from package MASS with AICc

Due to a bug in dropterm() and addterm() in package MASS, it is impossible to use AICc with stepAIC() . Here is a solution. Enter these commands and now you can use: stepAIC(g0, criteria="AICc") or stepAIC(g0, criteria="BIC") For example: datax <- data.frame(y=rnorm(100), x1=rnorm(100),                     x2=rnorm(100), x3=rnorm(100), x4=rnorm(100)) g0 <- glm(y ~ x1+x2+x3+x4, data=datax) gx_AICc <- stepAIC(g0, criteria="AICc") gx_AIC <- stepAIC(g0, criteria="AIC") gx_AIC <- stepAIC(g0, criteria="BIC")
Lire la suite