Publications by xi'an
latent Gaussian model workshop in Reykjavik
An announcement for an Icelandic meeting next September, meeting I would have loved to attend (darn!)… This meeting is sponsored by the BayesComp session, of course!!! We are pleased to announce that the University of Iceland will host the 3rd Workshop on Bayesian Inference for Latent Gaussian Models with Applications (LGM). The workshop will ...
1812 sym 6 img
Le Monde puzzle [#814]
The #814 Le Monde math puzzle was to find 100 digits (between 1 and 10) such that their sum is equal to their product. Given the ten possible values of those digits, this is equivalent to finding integers a1,…,a10 such that a1+…+a10=100 and a1+2a2+…+10a10=2a2x….x10a10, which reduces the number of unknowns from 100 to 10 (or even 9). Furth...
1427 sym R (465 sym/2 pcs) 6 img
a brief on naked statistics
Over the last Sunday breakfast I went through Naked Statistics: Stripping the Dread from the Data. The first two pages managed to put me in a prejudiced mood for the rest of the book. To wit: the author starts with some math bashing (like, no one ever bothers to tell us about the uses of high school calculus!) either because he really feels like ...
7009 sym 8 img
ISBA on INLA [webinar]
If you have missed the item of information, Håvard Rue is giving an ISBA webinar tomorrow on INLA: the ISBA Webinar on INLA is scheduled for April 4th, 2013 from 8:30 - 12:30 EDT. ------------------------------------------------------- To join the online meeting (Now from mobile devices using the Cisco WebEx Meeting App) ----------------------...
633 sym Python (799 sym/1 pcs) 4 img
painful truncnorm
As I wanted to simulate truncated normals in a hurry, I coded the inverse cdf approach: truncnorm=function(a,b,mu,sigma){ u=runif(1) u=qnorm(pnorm((a-mu)/sigma)*(1-u)+u*pnorm((b-mu)/sigma)) return(mu+sigma*u) } instead of using my own accept-reject algorithm. Poor shortcut as the method fails when a and b are too far from μ > truncnorm(...
1162 sym R (454 sym/3 pcs) 6 img
Le Monde puzzle [#815]
The last puzzle was as follows: Take a card stack with 32 cards and divide it into five non-empty piles. A move consists in doubling a pile size by taking card from a single and larger pile. Is it possible to recover the original stack by repeatedly using moves? Same question for 100 cards and five piles. I first defined a recursive R function...
1551 sym R (1371 sym/6 pcs) 6 img
BayesComp homepage
Today, the BayesComp section of ISBA launched its website. It is organised as a wiki and members of the section are strongly incited to take part into the construction of the website. To quote from Peter Green’s introduction: This new Wikidot site aims to be a community-edited resource on all aspects of Bayesian computation, available for all t...
1873 sym 4 img
MCMSki IV, Jan. 6-8, 2014, Chamonix (news #5)
More exciting news about MCMSki IV! First thing first, the 16 contributed sessions are now all-set, having gotten the stamp of approval from the scientific committee! Thanks to everyone who submitted a session proposal. (There were so many proposals that we alas had to reject some, as well as every single talk proposal… Sorry people: we hope to...
2216 sym 8 img
Le Monde puzzle [#817]
The weekly Le Monde puzzle is (again) a permutation problem that can be rephrased as follows: Find where denotes the set of permutations on {0,…,10} and is defined modulo 11 [to turn {0,…,10} into a torus]. Same question for and for This is rather straightforward to code if one adopts a brute-force approach:: perminmax=function(T=10^3){...
1069 sym R (797 sym/2 pcs) 16 img
interesting puzzle
In addition to its weekly mathematics puzzles, Le Monde is now publishing a series of vulgarisation books on mathematics, under the patronage of Cédric Villani. Jean-Michel Marin brought me two from the series, one on the golden number and one on Pythagoras’ theorem. (This is actually a translation of a series published by El Pais last year.) ...
1268 sym 6 img