Matchings up to permutations in sequences of independent trials (Q4522804)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1548615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matchings up to permutations in sequences of independent trials |
scientific article; zbMATH DE number 1548615 |
Statements
Matchings up to permutations in sequences of independent trials (English)
0 references
4 January 2001
0 references
sequences of independent trials
0 references
matching
0 references
tuple permutations of outcomes
0 references
limit distributions
0 references
convergence
0 references
Poisson law distribution
0 references
0.7806884
0 references
0.7627987
0 references
0.7445563
0 references
0.7443018
0 references
0.7420248
0 references
0.7414558
0 references
0.7396565
0 references
0.7331824
0 references
0.7321628
0 references
The paper investigates the random properties associated with the matchings of tuples in a sequence of independent polynomial trials. The matchings are computed up to the tuple permutations of outcomes, in the trial sequence \(X= (x_1,x_2,\dots, x_n)\) of i.i.d. (independent, identically distributed) random variables taking values in the set \(\{1,2,\dots, m\}\). The results obtained and the techniques used are generalizing, from the particular (exact) case of identity permutation to an arbitrary permutation, the corresponding classical approach of \textit{A. M. Zubkov} and \textit{V. G. Mikhajlov} [Theory Probab. Appl. 19, 172-179 (1974); translation from Teor. Veroyatn. Primen. 19, 173-181 (1974; Zbl 0326.60024)]. The main novel aspects of the paper are concentrated into four theorems that contain limit distributions, convergence and bounding results, for the following three types of random variables associated with the matchings in the sequence \(X\) of independent trials: (a) the number of pairs of tuples related by \(m\)-permutations in the sequence \(X\); (b) the length of the sequence \(X\) containing exactly one pair of tuples related by an \(m\)-permutation; (c) the maximal length of pairs of tuples in the sequence \(X\) related by \(m\)-permutations. Possibly the basic result, the author proves in detail the convergence to the Poisson law for the random variables specified by the (a) type.
0 references