Throughover the workshop in Chennai floated (!) the figure of Jean/André Ville, with his inequality generalising Markov’s, who invented martingales. He is not such a well-known figure in France—at least to me!—, despite having led a rather exceptional life, from being a visiting scholar in Berlin (in the Maison académique de Berlin, along with a certain Jean-Paul Sartre) and Vienna in the 1930s, to his wife being (in Berlin) one of the many (disposable and despised) lovers of JP Sartre (to whom an open-minded or clueless Ville later sent his thèse d’université on martingales and collectives, a much more substantial piece of work than the current PhD), to him working with German and Austrian mathematicians and logicians, such as Popper, Gödel, and Wald–who, what a coïncidence!, died in India from a plane crash in 1950 that had left from Chennai–and being impressed enough by the latter to passing an economics degree in the Sorbonne when back in Paris, establishing a minimax result for a zero-sum matrix game with two players, to his counter-example to von Mises’ kollectiv, to his nickname of the King of Counterexamples in the Viennese mathematics seminar, to him operating the first (Bull) computer at the Université de Paris. (Glenn Shafer wrote a detailed accounting of his youth, on which this post is based, up to his thesis defence but a few days from France mobilising for war–where his collegue Wolfgang Doeblin would kill himself the year after, to avoid capture–. With Bernard Bru, Edmond Malinvaud and Alain Trognon among the people who helped.) After the war, he worked several years as a prépa maths teacher before working for a French State electricity companion on signal theory and Monte Carlo methods, and then returning to Université de Paris as a professor in 1957.
Archive for history of Monte Carlo
André ou Jean Ville (1910-1989)
Posted in Books, pictures, Travel, University life with tags 25w5482, Abraham Wald, Alain Trognon, André Ville, Andrey Markov, École Normale Supérieure, Berlin, Bernard Bru, BIRS-CMI, Bull computers, Chennai, Edmond Malinvaud, Emile Borel, George Darmois, Glenn Shafer, history of Monte Carlo, history of statistics, India, Jean Ville, Jean-Paul Sartre, Karl Popper, Kurt Gödel, martingales, Maurice Fréchet, minimax strategy, Monte Carlo methods, Paris, Paul Lévy, plane crash, Richard von Mises, signal theory, Simone de Beauvoir, Sorbonne, supermartingale, two-player game, Université de Paris, Vienna, Ville's inequality, Wolfgang Doeblin, WW II on August 12, 2025 by xi'anCongrats, Dr. Andral!
Posted in Books, pictures, Statistics, University life with tags adaptive Monte Carlo algorithm, ENSAE, history of Monte Carlo, importance MCMC, importance sampling, jury, normalizing flow, Paris, PDMP, PhD thesis, PSL Research University, quasi-Monte Carlo methods, thesis defence, Université Paris Dauphine on November 27, 2024 by xi'an
Jerome Spanier (1930-2024)
Posted in Books, Statistics, University life with tags Ely Gelbard, history of Monte Carlo, Jerome Spanier, Monte Carlo methods, neutron transport, numerical transport, qMC on April 4, 2024 by xi'an
[very] simple rejection Monte Carlo
Posted in Books, pictures, R, University life with tags accept-reject algorithm, arXiv, Brussels, dominating measure, history of Monte Carlo, John von Neumann, Monte Carlo Statistical Methods, Non-Uniform Random Variate Generation, pseudo-random generator on March 29, 2024 by xi'an
“In recent years, the Rejection Monte Carlo (RMC) algorithm has emerged sporadically in literature under alternative names such as screening sampling or reject-accept sampling algorithms”
First, I was intrigued enough by a new arXival spotted in the Thalys train from Brussels to take a deeper look at it, but soon realised there was nothing of substance in the paper. Which solely recalls the fundamental of (accept-)reject algorithms, invented in the early days of computer simulation by von Neumann (even though the preprint refers to much more recent publications). Without providing the average acceptance probability as being equal to the inverse of the bounding constant [independently of the dimension of the random variable] and no mention of The Bible either… But with a standard depiction of accepted vs rejected points as uniformly dispersed on the subgraph of the proposal (as in the above taken from our very own Monte Carlo statistical Methods). Funnily enough, the most basic rejection algorithm, that is, the one based on a uniform sampling from a bounding (hyper)box is illustrated for a Normal target, although the latter has infinite support. And the paper seems to conclude on the appeal of using uniform proposals over bounding boxes, even though the increasing inefficiency against the dimension is well-known. A very simple rejection then, indeed!
another first
Posted in Statistics with tags Chemical Physics Letters, history of Monte Carlo, importance sampling, John Valleau, Markov chain Monte Carlo, MCMC, Metropolis algorithm, umbrella sampling, Wilfred Keith Hastings on July 1, 2022 by xi'an
A question related to the earlier post on the first importance sampling in print, about the fist Markov chain Monte Carlo in print. Again uncovered by Charly, a 1973 Chemical Physics paper by Patey and Valleau, the latter inventing umbrella sampling with Torrie at about the same time. (In a 1972 paper in the same journal with Card, Valleau uses Metropolis Monte Carlo. While Hastings, also at the University of Toronto uses Markov chain sampling.)
