Fast Computation by Block Permanents of Cumulative Distribution Functions of Order Statistics from Several Populations

References

• Aitken , A. C. ( 1939 ). Determinants and Matrices . New York : Oliver and Boyd .
   Google Scholar
• Arnold , B. C. , Balakrishnan , N. ( 1989 ). Relations, Bounds and Approximations for Order Statistics . Lecture Notes in Statistics 53 . Berlin : Springer .
   Google Scholar
• Balakrishnan , N. ( 2007 ). Permanents, order statistics, outliers and robustness . Revista Matematica Complutense 20 : 7 – 107 .
   Web of Science ®Google Scholar
• Balakrishnan , N. , Rao , C. R. ( 1998 ). Order statistics: an introduction . Order Statistics: Theory & Methods . Vol. 16 . Handbook of Statistics . Amsterdam : North-Holland , pp. 3 – 24 .
   Google Scholar
• Bapat , R. B. ( 1990 ). Permanents in probability and statistics . Lin. Algebr. Applic. 127 : 3 – 25 .
   Web of Science ®Google Scholar
• Bapat , R. B. , Beg , M. I. ( 1989 ). Order statistics for non identically distributed variables and permanents . Sankhyā Ser. A 51 : 79 – 93 .
   Google Scholar
• Benjamini , Y. , Hochberg , Y. ( 1995 ). Controlling the false discovery rate: a practical and powerful approach to multiple testing . J. Roy. Statist. Soc. Ser. B 57 : 289 – 300 .
   Web of Science ®Google Scholar
• Cao , G. , West , M. ( 1997 ). Computing distributions of order statistics . Commun. Statist. Theor. Meth. 26 : 755 – 764 .
   Web of Science ®Google Scholar
• Childs , A. , Balakrishnan , N. ( 2006 ). Relations for order statistics from non-identical logistic random variables and assessment of the effect of multiple outliers on the bias of linear estimators . J. Statist. Plann. Infer. 136 ( 7 ): 2227 – 2253 .
   Google Scholar
• David , H. A. , Nagaraja , H. N. ( 2003 ). Order Statistics. , 3rd ed. Wiley Series in Probability and Statistics, Wiley-Interscience . Hoboken , NJ : John Wiley & Sons .
   Google Scholar
• Forbert , H. , Marx , D. ( 2003 ). Calculation of the permanent of a sparse positive matrix . Comput. Phys. Commun. 150 : 267 – 273 .
   Web of Science ®Google Scholar
• Glueck , D. H. , Muller , K. E. , Karimpour-Fard , A. , Hunter , L. ( 2008 ). Expected power for the false discover rate with independence . Commun. Statist. Theor. Meth. 37 : 1855 – 1866 .
   PubMed Web of Science ®Google Scholar
• Hogg , R. V. , Craig , A. T. ( 1978 ). Introduction to Mathematical Statistics. , 4th ed. New York : Macmillan Publishing Co., Inc .
   Google Scholar
• Jerrum , M. , Sinclair , A. , Vigoda , E. ( 2004 ). A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries . J. ACM 51 : 671 – 697 .
   Web of Science ®Google Scholar
• Knuth , D. E. (1998). The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. , 3rd ed.New York : Addison-Wesley.
   Google Scholar
• Shapiro , L. W. ( 1976 ). A Catalan triangle . Discrete Math. 14 : 83 – 90 .
   Web of Science ®Google Scholar
• Stanley , R. P. ( 1999 ). Enumerative Combinatorics . Vol. 2 . Volume 62 of Cambridge Studies in Advanced Mathematics , Cambridge : Cambridge University Press .
   Google Scholar
• Stirzaker , D. ( 2006 ). Elementary Probability: Second Edition . Cambridge : Cambridge University Press .
   Google Scholar
• Valiant , L. G. ( 1979 ). The complexity of computing the permanent . Theoret. Comput. Sci. 8 : 189 – 201 .
   Google Scholar
• Weisstein , E. W. ( 2006 ). Permanent. From MathWorld – A Wolfram Web Resource. http://mathworld.wolfram.com/Permanent.html .
   Google Scholar