A probabilistic derivation of Stirling's formula
MetadataShow full item record
Stirling's formula is one of the most frequently used results from asymptotics. It is used in probability and statistics, algorithm analysis and physics. In this thesis we shall give a new probabilistic derivation of Stirling's formula. Our motivation comes from sampling randomly with replacement from a group of n distinct alternatives. Usually a repetition will occur before we obtain all n distinct alternatives consecutively. We shall show that Stirling's formula can be derived and interpreted as follows: as n (to infinity) the expected total number of distinct alternatives we must sample before all n are obtained consecutively is asymptotically equal to the expected number of attempts we make to obtain all n distinct alternatives consecutively times the expected number of distinct alternatives obtained per attempt.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Milch, Paul R. (Monterey, California. Naval Postgraduate School, 1988-09); NPS-55-88-009A mathematical model, using semi Markov Processes, is suggested for the career paths of military officers. The model consists of a rectangular array of nodes with rows representing activity types and columns representing ...
Howard, Gilbert Thoreau (Monterey, California. Naval Postgraduate School, 1971-01); NPS55HK71011AA formulation is given for minimizing the expected total number of shortages in a multi-item inventory system under a continuous review policy. The variable reorder levels and order quantities must be set to meet constraints ...
Benjes, Christopher (Monterey, California. Naval Postgraduate School, 1971-06);The fact that Stirling Numbers of the Second Kind have arisen in various nonrelated fields, from microelectronics to topology, established the need for a more extensive study of the properties of those Stirling numbers. ...