INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 18, No. 1, Winter 2006, pp. 19-30
DOI: 10.1287/ijoc.1040.0105
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Evans, D. L.
Right arrow Articles by Drew, J. H.
Right arrow Search for Related Content

The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping

Diane L. Evans, Lawrence M. Leemis, John H. Drew

Department of Mathematics, Rose–Hulman Institute of Technology, 5500 Wabash Avenue, Terre Haute, Indiana 47803, USA
Department of Mathematics, The College of William & Mary, P.O. Box 8795, Williamsburg, Virginia 23187–8795, USA
Department of Mathematics, The College of William & Mary, P.O. Box 8795, Williamsburg, Virginia 23187–8795, USA

diane.evans{at}rose-hulman.edu
leemis{at}math.wm.edu
jhdrew{at}math.wm.edu

An algorithm for computing the PDF of order statistics drawn from discrete parent populations is presented, along with an implementation of the algorithm in a computer algebra system. Several examples and applications, including exact bootstrapping analysis, illustrate the utility of this algorithm. Bootstrapping procedures require that B bootstrap samples be generated in order to perform statistical inference concerning a data set. Although the requirements for the magnitude of B are typically modest, a practitioner would prefer to avoid the resampling error introduced by choosing a finite B, if possible. The part of the order-statistic algorithm for sampling with replacement from a finite sample can be used to perform exact bootstrapping analysis in certain applications, eliminating the need for replication in the analysis of a data set.

Key words: combinatorial algorithms; computer algebra systems; probability; probability distributions; statistics
History: received June 2000; revised August 2001; revised October 2003; revised April 2004; accepted June 2004.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.