Blog Archives

truncated normal algorithms

January 3, 2017
By
truncated normal algorithms

Nicolas Chopin (CREST) just posted an entry on Statisfaction about the comparison of truncated Normal algorithms run by Alan Rogers, from the University of Utah. Nicolas wrote a paper in Statistics and Computing about a simulation method, which proposes a Ziggurat type of algorithm for this purpose, and which I do not remember reading, thanks […]

Read more »

a Galton-Watson riddle

December 29, 2016
By
a Galton-Watson riddle

The Riddler of this week has an extinction riddle which summarises as follows: One observes a population of N individuals, each with a probability of 10⁻⁴ to kill the observer each day. From one day to the next, the population decreases by one individual with probability K√N 10⁻⁴ What is the value of K that […]

Read more »

puzzled by harmony [not!]

December 12, 2016
By
puzzled by harmony [not!]

In answering yet another question on X validated about the numerical approximation of the marginal likelihood, I suggested using an harmonic mean estimate as a simple but worthless solution based on an MCMC posterior sample. This was on a toy example with a uniform prior on (0,π) and a “likelihood” equal to sin(θ) [really a […]

Read more »

ratio-of-uniforms [-1]

December 11, 2016
By
ratio-of-uniforms [-1]

Luca Martino pointed out to me my own and forgotten review of a 2012 paper of his, “On the Generalized Ratio of Uniforms as a Combination of Transformed Rejection and Extended Inverse of Density Sampling” that obviously discusses a generalised version of Kinderman and Monahan’s (1977) ratio-of-uniform method. And further points out the earlier 1991 paper […]

Read more »

flea circus

December 7, 2016
By
flea circus

An old riddle found on X validated asking for Monte Carlo resolution  but originally given on Project Euler: A 30×30 grid of squares contains 30² fleas, initially one flea per square. When a bell is rung, each flea jumps to an adjacent square at random. What is the expected number of unoccupied squares after 50 […]

Read more »

the incredible accuracy of Stirling’s approximation

December 6, 2016
By
the incredible accuracy of Stirling’s approximation

The last riddle from the Riddler [last before The Election] summed up to find the probability of a Binomial B(2N,½) draw ending up at the very middle, N. Which is If one uses the standard Stirling approximation to the factorial function, log(N!)≈Nlog(N) – N + ½log(2πN) the approximation to ℘ is 1/√πN, which is not […]

Read more »

ratio-of-uniforms [#4]

December 1, 2016
By
ratio-of-uniforms [#4]

Possibly the last post on random number generation by Kinderman and Monahan’s (1977) ratio-of-uniform method. After fiddling with the Gamma(a,1) distribution when a<1 for a while, I indeed figured out a way to produce a bounded set with this method: considering an arbitrary cdf Φ with corresponding pdf φ, the uniform distribution on the set […]

Read more »

asymptotically exact inference in likelihood-free models [a reply from the authors]

November 30, 2016
By
asymptotically exact inference in likelihood-free models [a reply from the authors]

[Following my post of lastTuesday, Matt Graham commented on the paper with force détails. Here are those comments. A nicer HTML version of the Markdown reply below is also available on Github.] Thanks for the comments on the paper! A few additional replies to augment what Amos wrote: This however sounds somewhat intense in that […]

Read more »

sampling by exhaustion

November 24, 2016
By
sampling by exhaustion

The riddle set by The Riddler of last week sums up as follows: Within a population of size N, each individual in the population independently selects another individual. All individuals selected at least once are removed and the process iterates until one or zero individual is left. What is the probability that there is zero […]

Read more »

Monty Python generator

November 22, 2016
By
Monty Python generator

By some piece of luck I came across a paper by the late George Marsaglia, genial contributor to the field of simulation, and Wai Wan Tang, entitled The Monty Python method for generating random variables. As shown by the below illustration, the concept is to flip the piece H outside the rectangle back inside the […]

Read more »


Subscribe

Email:

  Subscribe