Some asymptotic results on multiple matching

1974 ◽  
Vol 11 (03) ◽  
pp. 479-492
Author(s):  
R. Hafner ◽  
W. Sendler
Keyword(s):  
Finite Number ◽  
Random Variable ◽  
Limiting Distribution ◽  
Equal Probability ◽  
Asymptotic Results ◽  
Main Result Theorem ◽  
Common Distribution ◽  
Result Theorem ◽  
The Common

We considers≦nrandomly chosen permutations of the numbers 1, 2, …,n, and write them under each other, thus forming ans×nmatrix, called “random-batch”. A rule, prescribing how many elements of a column may occur exactly one time, how many may occur exactly two times, etc., is called a fixpoint-structure. Assuming each possible permutation to be chosen with equal probability, the number of columns having a certain fixpoint-structureFis a random variableX(F). The limiting distribution ofX(F) forn→ ∞is considered for different cases ofs=s(n). The main result (Theorem 4) says, that the common distribution of a finite numbertof given fixpoint-structures tends to the product oftPoisson-laws,n→ ∞.

Some asymptotic results on multiple matching

1974 ◽  
Vol 11 (3) ◽  
pp. 479-492 ◽  
Author(s):  
R. Hafner ◽  
W. Sendler
Keyword(s):  
Finite Number ◽  
Random Variable ◽  
Limiting Distribution ◽  
Equal Probability ◽  
Asymptotic Results ◽  
Main Result Theorem ◽  
Common Distribution ◽  
Result Theorem ◽  
The Common

We consider s ≦ n randomly chosen permutations of the numbers 1, 2, …, n, and write them under each other, thus forming an s × n matrix, called “random-batch”. A rule, prescribing how many elements of a column may occur exactly one time, how many may occur exactly two times, etc., is called a fixpoint-structure. Assuming each possible permutation to be chosen with equal probability, the number of columns having a certain fixpoint-structure F is a random variable X(F). The limiting distribution of X(F) for n→ ∞ is considered for different cases of s = s(n). The main result (Theorem 4) says, that the common distribution of a finite number t of given fixpoint-structures tends to the product of t Poisson-laws, n→ ∞.

An extension of a lemma of Wald

1966 ◽  
Vol 3 (01) ◽  
pp. 272-273 ◽  
Author(s):  
H. Robbins ◽  
E. Samuel
Keyword(s):  
Natural Extension ◽  
Random Variables ◽  
Random Variable ◽  
Common Distribution ◽  
The Common ◽  
Image Position ◽  
Independent Identically Distributed

We define a natural extension of the concept of expectation of a random variable y as follows: M(y) = a if there exists a constant − ∞ ≦ a ≦ ∞ such that if y 1, y 2, … is a sequence of independent identically distributed (i.i.d.) random variables with the common distribution of y then

An extension of a lemma of Wald

1966 ◽  
Vol 3 (1) ◽  
pp. 272-273 ◽  
Author(s):  
H. Robbins ◽  
E. Samuel
Keyword(s):  
Natural Extension ◽  
Random Variables ◽  
Random Variable ◽  
Common Distribution ◽  
The Common ◽  
Image Position ◽  
Independent Identically Distributed

We define a natural extension of the concept of expectation of a random variable y as follows: M(y) = a if there exists a constant − ∞ ≦ a ≦ ∞ such that if y1, y2, … is a sequence of independent identically distributed (i.i.d.) random variables with the common distribution of y then

A Note on the Accuracy of Normal Approximation of Random Quantities

2021 ◽  
Vol 73 (1) ◽  
pp. 62-67
Author(s):  
Ibrahim A. Ahmad ◽  
A. R. Mugdadi
Keyword(s):  
Sample Size ◽  
Order Statistic ◽  
Normal Approximation ◽  
Order Approximation ◽  
Random Variables ◽  
Random Variable ◽  
Limiting Distribution ◽  
Exact Order ◽  
Fixed Sample ◽  
Independent Identically Distributed

For a sequence of independent, identically distributed random variable (iid rv's) [Formula: see text] and a sequence of integer-valued random variables [Formula: see text], define the random quantiles as [Formula: see text], where [Formula: see text] denote the largest integer less than or equal to [Formula: see text], and [Formula: see text] the [Formula: see text]th order statistic in a sample [Formula: see text] and [Formula: see text]. In this note, the limiting distribution and its exact order approximation are obtained for [Formula: see text]. The limiting distribution result we obtain extends the work of several including Wretman[Formula: see text]. The exact order of normal approximation generalizes the fixed sample size results of Reiss[Formula: see text]. AMS 2000 subject classification: 60F12; 60F05; 62G30.

The central limit problem for trimmed sums

1987 ◽  
Vol 102 (2) ◽  
pp. 329-349 ◽  
Author(s):  
Philip S. Griffin ◽  
William E. Pruitt
Keyword(s):  
Distribution Function ◽  
Random Variables ◽  
Random Variable ◽  
Limit Problem ◽  
Absolute Value ◽  
Trimmed Sums ◽  
Common Distribution ◽  
Common Distribution Function ◽  
Central Limit Problem ◽  
Trimmed Sum

Let X, X1, X2,… be a sequence of non-degenerate i.i.d. random variables with common distribution function F. For 1 ≤ j ≤ n, let mn(j) be the number of Xi satisfying either |Xi| > |Xj|, 1 ≤ i ≤ n, or |Xi| = |Xj|, 1 ≤ i ≤ j, and let (r)Xn = Xj if mn(j) = r. Thus (r)Xn is the rth largest random variable in absolute value from amongst X1, …, Xn with ties being broken according to the order in which the random variables occur. Set (r)Sn = (r+1)Xn + … + (n)Xn and write Sn for (0)Sn. We will refer to (r)Sn as a trimmed sum.

Choice, Order Statistics and the Distribution of Earnings

1997 ◽  
Author(s):  
Michael Sattinger
Keyword(s):  
Order Statistics ◽  
Order Statistic ◽  
Occupational Choice ◽  
Earnings Inequality ◽  
Limiting Distribution ◽  
Asymptotic Results ◽  
Expected Earnings

This paper analyzes the distribution of earnings as being generated by workers choosing among occupations on the basis of earnings maximization. A worker’s earnings then have characteristics of an order statistic. The extension to multiple occupations leads to the revision results from A.D. Roy’s two-occupation case. An additional occupation raises expected earnings while in general reducing earnings inequality. Asymptotic results from order statistics suggest that the process of occupational choice determines a limiting distribution of earnings independently of underlying distributions of occupational abilities.

PATH INTEGRAL METHOD FOR LIMITING DISTRIBUTION OF AN ESTIMATOR ARISING FROM AN AR(1)-PROCESS WITH A UNIT ROOT

2013 ◽  
Vol 16 (04) ◽  
pp. 1350029
Author(s):  
SHIH-FENG HUANG ◽  
YUH-JIA LEE ◽  
HSIN-HUNG SHIH
Keyword(s):  
Characteristic Function ◽  
Path Integral ◽  
Unit Root ◽  
Autoregressive Model ◽  
Integral Method ◽  
Unit Root Test ◽  
Random Variable ◽  
Limiting Distribution ◽  
First Order ◽  
Path Integral Method

We propose the path-integral technique to derive the characteristic function of the limiting distribution of the unit root test in a first order autoregressive model. Our results provide a new and useful approach to obtain the closed form of the characteristic function of a random variable associated with the limiting distribution, which is realized as a ratio of Brownian functionals on the classical Wiener space.

3 Power and sample size for ABE in the 2× 2 design Here we give formulae for the calculation of the power of the TOST procedure assuming that there are in total n subjects in the 2× 2 trial. Suppose that the null hypotheses given below are to be tested using a 100(1 − α)% two-sided confidence interval and a power of (1 − β) is required to reject these hypotheses when they are false. H :µ ≤− ln 1.25 H :µ ≥ ln 1.25. Let us define x to be a random variable that has a noncentral t-distribution with df degrees of freedom and noncentrality parameter nc, i.e., x ∼ t(df,nc). The cumulative distribution function of x is defined as CDF(t,df,nc) = Pr(x≤ t). Assume that the power is to be calculated using log(AUC). If σ is the common within-subject variance for T and R for log(AUC), and n/2 subjects are allocated to each of the sequences RT and TR, then 1−β = CDF(t , df,nc )−CDF(t , df,nc ) (7.1) where √ n(log(µ )− log(0.8)) nc = 2σ √ n(log(µ )− log(1.25)) nc = 2σ √ (n− 2)(nc −nc = ) df 2t and t is the 100(1 − α)% point of the central t-distribution on n− 2 degrees of freedom. Some SAS code to calculate the power for an ABE 2 × 2 trial is given below, where the required input variables are α, σ value of the ratio µ and n, the total number of subjects in the trial.

2003 ◽  
pp. 361-361
Keyword(s):  
Distribution Function ◽  
Confidence Interval ◽  
Degrees Of Freedom ◽  
Random Variable ◽  
Noncentrality Parameter ◽  
Cumulative Distribution ◽  
Total N ◽  
The Common ◽  
Input Variables ◽  
T Distribution

scholarly journals A note on the implications of factorial invariance for common factor variable equivalence

2016 ◽  
Author(s):  
Michael Maraun ◽  
Moritz Heene
Keyword(s):  
Common Factor ◽  
Random Variables ◽  
Random Variable ◽  
Factorial Invariance ◽  
Technical Examination ◽  
The Common ◽  
Factor Variable

There has come to exist within the psychometric literature a generalized belief to the effect that a determination of the level of factorial invariance that holds over a set of k populations Δj, j = 1..s, is central to ascertaining whether or not the common factor random variables ξj, j = 1..s, are equivalent. In the current manuscript, a technical examination of this belief is undertaken. The chief conclusion of the work is that, as long as technical, statistical senses of random variable equivalence are adhered to, the belief is unfounded.

scholarly journals A note on the paper "Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming"

2020 ◽  
Author(s):  
Nazih Abderrazzak Gadhi ◽  
Aissam Ichatouhane
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Optimality Condition ◽  
Short Proof ◽  
Necessary Optimality Condition ◽  
Main Result Theorem ◽  
Correct Formulation ◽  
Result Theorem ◽  
Infinite Programming ◽  
Interval Valued

A nonsmooth semi-infinite interval-valued vector programming problem is solved in the paper by Jennane et all. (RAIRO-Oper. Res. doi: 10.1051/ro/2020066, 2020). The necessary optimality condition obtained by the authors, as well as its proof, is false. Some counterexamples are given to refute some results on which the main result (Theorem 4.5) is based. For the convinience of the reader, we correct the faulty in those results, propose a correct formulation of Theorem 4.5 and give also a short proof.

Sign in / Sign up

Export Citation Format

Share Document