Bapat–Beg theorem

Bapat–Beg theorem

In probability theory, the Bapat–Beg theorem R. B. Bapat and M. I. Beg. Order statistics for nonidentically distributed variables and permanents. "Sankhyā Ser. A", 51(1):79–93, 1989. [http://www.ams.org/mathscinet-getitem?mr=1065561 MR1065561] ] gives the joint cumulative distribution function of order statistics of independent but not necessarily identically distributed random variables in terms of the cumulative distribution functions of the random variables. Simpler proof of this can be found in Sayaji Hande. A note on order statistics for nonidentically distributed variables "Sankhyā Ser. A", 56(2):365–368, 1994. [http://www.ams.org/mathscinet-getitem?mr=1664921 MR1664921] ]

This result describes the order statistics when each element of the sample is obtained from a possibly different population with a different probability distribution. Ordinarily, all elements of the sample are obtained from the same population and thus have the same probability distribution.

The theorem

Let extstyle X_{i}, extstyle i=1,ldots,m be independent real valued random variables with cumulative distribution functions extstyle F_{i}left( x ight) . Denote the order statistics by extstyle Y_{1},Y_{2},ldots,Y_{m}, with extstyle Y_{1}leq Y_{2}leqcdotsleq Y_{m}. Further let extstyle y_{0}=-infty, extstyle y_{k+1}=+infty, and

: i_{0}=0,quad i_{k+1}=m,quad F_{i}left( y_{0} ight) =0,quad F_{i}left( y_{k+1} ight) =1

for all extstyle i. For extstyle 1leq n_{1}leq m and extstyle y_{1}leq y_{2}leqcdotsleq y_{k}, the joint cumulative distribution function of the subset extstyle Y_{n_{1,ldots Y_{n_{k of the order statistics satisfies

:egin{align} & F_{Y_{n_{1,ldots Y_{n_{k}left( y_{1},ldots,y_{k} ight)\ & =Prleft{ Y_{n_{1leq y_{1}wedge Y_{n_{2leq y_{2}wedgecdotswedge Y_{n_{kleq y_{k} ight} \ & =sum_{i_{k}=n_{k^{m}cdotssum_{i_{2}=n_{2^{i_{3,sum _{i_{1}=n_{1^{i_{2frac{P_{i_{1},ldots,i_{kleft( y_{1},ldots ,y_{k} ight) }{left( i_{1}-i_{0} ight) !left( i_{2}-i_{1} ight) !cdotsleft( i_{k+1}-i_{k} ight) !}, end{align}

where

:egin{align} & P_{i_{1},ldots,i_{kleft( y_{1},ldots,y_{k} ight) \ & quad= ext{per}egin{bmatrix} left [ F_{i}(y_{j})-F_{i}(y_{j-1}) ight] _{left( i_{j}-i_{j-1} ight) imes1}end{bmatrix} _{j=1,i=1}^{j=k,i=m}end{align}

is the permanent of a block matrix with the subscript extstyle left( i_{j}-i_{j-1} ight) imes1 denoting the dimension of a block obtained by repeating the same entry, and the block row index extstyle j and block column index extstyle i.

The independent identically distributed case

In the case when the variables extstyle X_{1}, extstyle X_{2},ldots,X_{m} are independent and identically distributed with cumulative probability distribution function extstyle F_{i}=F for all extstyle i, the Bapat–Beg theorem reduces to Deborah H. Glueck, Anis Karimpour-Fard, Jan Mandel, Larry Hunter, Keith E. Muller. "Fast computation by block permanents of cumulative distribution functions of order statistics from several populations," [http://arxiv.org/abs/0705.3851 arXiv:0705.3851] , 2007]

:egin{align} & F_{Y_{n_{1,ldots Y_{n_{k}left( y_{1},ldots,y_{k} ight) \ & =Prleft{ Y_{n_{1leq y_{1}wedge Y_{n_{2leq y_{2}wedge cdotswedge Y_{n_{kleq y_{k} ight} \ & =sum_{i_{k}=n_{k^{m}cdotssum_{i_{2}=n_{2^{i_{3,sum_{i_{1}=n_{1^{i_{2m!prodlimits_{j=1}^{k+1}frac{left [ Fleft( y_{j} ight) -Fleft( y_{j-1} ight) ight] ^{i_{j}-i_{j-1}{left( i_{j}-i_{j-1} ight) !}, end{align}

where again

: i_{0}=0,quad i_{k+1}=m,quad Fleft( y_{0} ight) =0,quad Fleft( y_{k+1} ight) =1.

Remarks

* No assumption of continuity of the cumulative distribution functions is needed.

* The theorem is formulated for the joint cumulative probability distribution function in terms of a subset of the order statistics and ordered arguments. If the inequalities extstyle y_{1}leq y_{2}leqcdotsleq y_{k} are not imposed, some of the inequalities extstyle Y_{n_{jleq y_{j} may be redundant (because always extstyle Y_{1}leq Y_{2}leqcdotsleq Y_{m}) and the argument list needs to be first reduced by dropping all extstyle y_{j} such that extstyle y_{i}>y_{j} for some extstyle i.

Complexity

The Bapat–Beg formula involves exponentially many permanents, and the complexity of the computation of the permanent itself is at least exponential. Thus, in the general case, the formula is not practical. However, when the random variables have only two possible distributions, the complexity can be reduced to O(m^{2k}) Deborah H. Glueck, Anis Karimpour-Fard, Jan Mandel, Larry Hunter, Keith E. Muller. "Fast computation by block permanents of cumulative distribution functions of order statistics from several populations," [http://arxiv.org/abs/0705.3851 arXiv:0705.3851] , 2007] . Thus, in the case of two populations, the complexity is polynomial in "m" for any fixed number of statistics "k".

ee also

*For standard results for the distribution of order statistics for independent and identically-distributed random variables see, for example, N. Balakrishnan and C. R. Rao. Order statistics: an introduction. In "Order statistics: theory & methods", volume 16 of "Handbook of Statist.", pages 3–24. North-Holland, Amsterdam, 1998.

]
*permanent
*independent and identically-distributed random variables

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Order statistic — Probability distributions for the n = 5 order statistics of an exponential distribution with θ = 3 In statistics, the kth order statistic of a statistical sample is equal to its kth smallest value. Together with rank statistics, order statistics… …   Wikipedia

  • List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia

  • Permanent — In linear algebra, the permanent of a matrix is a function of a matrix related to the determinant. The permanent as well as the determinant are polynomials of the entries of the matrix. Definition The permanent of an n by n matrix A = ( a i,j )… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”