Alfred Aeppli

Alfred Aeppli was a Swiss mathematician. The Pólya–Aeppli distribution in probability theory and statistics is named after him and his doctoral advisor George Pólya.

Alfred Aeppli
Born(1894-07-15)15 July 1894
Zürich, Switzerland
NationalitySwiss
CitizenshipSwiss
Alma materETH Zürich, Switzerland
Known forPólya–Aeppli distribution
Scientific career
FieldsProbability theory
ThesisZur Theorie verketteter Wahrscheinlichkeiten: Markoff-Ketten höherer Ordnung ("On the theory of chained probabilities: Higher-order Markov chains") (1924)
Academic advisorsGeorge Pólya
Hermann Weyl

Life and work

Alfred Aeppli was born in Zürich on 15 July 1894 to Alfred Aeppli and Rosa Aeppli-Gehring. He went to a primary school in Zürich and the canton's Industrial School, where he received his matura in the summer of 1913. Afterwards, Aeppli studied at the Eidgenössische Technische Hochschule (ETH Zürich) at the department for higher teachers of mathematics and physics. In the winter semester of 1914–1915 he was on leave for military service. After receiving his Diplom, he worked at a private school in Germany for a year and returned to the ETH in the spring of 1919 as a research assistant of Arthur Hirsch.

Aeppli earned his doctorate in 1924 under the supervision of George Pólya and Hermann Weyl.[1] He came up with the Pólya–Aeppli distribution in his doctoral dissertation.[2] This discovery was published by Pólya in 1930, and he credited its discovery to his student Aeppli.[3] The Pólya–Aeppli distribution, now also known as the geometric Poisson distribution,[4] is a particular case of the compound Poisson distribution, and is used to describe objects that come in clusters, where the number of clusters follows a Poisson distribution and the number of objects within a cluster follows a geometric distribution.[5]

gollark: Well, it's easier than admitting you might have made a mistake!
gollark: You know, when I break my stuff through configuration changes, I generally manage to restore it within an hour or so.
gollark: I mean, yes, it's harder to memorize 128-bit addresses than 32-bit ones, but... we have computers to remember long things for us now.
gollark: What's wrong with IPv6? I can't really say much about the design changes versus v4 other than addresses, but it seems... necessary.
gollark: You need two ~s. It's a weird Markdown variant.

References
  1. Alfred Aeppli at the Mathematics Genealogy Project
  2. Aeppli, Alfred (1924). Zur Theorie verketteter Wahrscheinlichkeiten: Markoff-Ketten höherer Ordnung [On the theory of chained probabilities: Higher-order Markov chains] (PDF) (in German). Zurich: Gebr. Leemann & Co. A.-G.
  3. Pólya, George (1930). "Sur quelques points de la théorie des probabilités" [On some points of probability theory] (PDF). Annales de'l I. H. P. (in French). 1 (2): 117–161.
  4. Sherbrooke, C. C. (1968). "Discrete compound Poisson processes and tables of the geometric Poisson distribution". Naval Research Logistics Quarterly. 15: 189–203.
  5. Johnson, N.L.; Kotz, S.; Kemp, A.W. (2005). Univariate Discrete Distributions (3rd ed.). New York: Wiley.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.