By some piece of luck, I came upon the book Think Bayes: Bayesian Statistics Made Simple, written by Allen B. Downey and published by Green Tea Press [which I could relate to No Starch Press, focussing on coffee!, which published Statistics Done Wrong that I reviewed a while ago] which usually publishes programming books with […]
By some piece of luck, I came upon the book Think Bayes: Bayesian Statistics Made Simple, written by Allen B. Downey and published by Green Tea Press [which I could relate to No Starch Press, focussing on coffee!, which published Statistics Done Wrong that I reviewed a while ago] which usually publishes programming books with […]
By some piece of luck, I came upon the book Think Bayes: Bayesian Statistics Made Simple, written by Allen B. Downey and published by Green Tea Press [which I could relate to No Starch Press, focussing on coffee!, which published Statistics Done Wrong that I reviewed a while ago] which usually publishes programming books with […]
A combinatorics Le Monde mathematical puzzle: In the set {1,…,12}, numbers adjacent to i are called friends of i. How many distinct subsets of size 5 can be chosen under the constraint that each number in the subset has at least a friend with him? In a brute force approach, I tried a quintuple loop […]
A combinatorics Le Monde mathematical puzzle: In the set {1,…,12}, numbers adjacent to i are called friends of i. How many distinct subsets of size 5 can be chosen under the constraint that each number in the subset has at least a friend with him? In a brute force approach, I tried a quintuple loop […]
A combinatorics Le Monde mathematical puzzle: How many distinct integers between 0 and 16 can one pick so that all positive differences are distinct? If k is the number of distinct integers, the number of positive differences is 1+2+…+(k-1) = k(k-1)/2, which cannot exceed 16, because it is a subset of {1,2,…,16}, meaning k cannot […]
A combinatorics Le Monde mathematical puzzle: How many distinct integers between 0 and 16 can one pick so that all positive differences are distinct? If k is the number of distinct integers, the number of positive differences is 1+2+…+(k-1) = k(k-1)/2, which cannot exceed 16, because it is a subset of {1,2,…,16}, meaning k cannot […]
For quite a while, I entertained the idea that Beta and Dirichlet proposals were more adequate than (log-)normal random walks proposals for parameters on (0,1) and simplicia (simplices, simplexes), respectively, when running an MCMC. For instance, for p in (0,1) the value of the Markov chain at time t-1, the proposal at time t could […]
For quite a while, I entertained the idea that Beta and Dirichlet proposals were more adequate than (log-)normal random walks proposals for parameters on (0,1) and simplicia (simplices, simplexes), respectively, when running an MCMC. For instance, for p in (0,1) the value of the Markov chain at time t-1, the proposal at time t could […]
![ABC model choice via random forests [and no fire]](https://xianblog.files.wordpress.com/2012/04/dscn2914.jpg?w=254&h=452)
While my arXiv newspage today had a puzzling entry about modelling UFOs sightings in France, it also broadcast our revision of Reliable ABC model choice via random forests, version that we resubmitted today to Bioinformatics after a quite thorough upgrade, the most dramatic one being the realisation we could also approximate the posterior probability of […]
