Criteria for the almost sure stability of weighted maxima of bounded i.i.d. random variables

2004 ◽  
pp. 265-270
Author(s):  
R. Tomkins
Keyword(s):  
Random Variables ◽  
Almost Sure Stability

Almost sure stability of maxima

1973 ◽  
Vol 10 (2) ◽  
pp. 387-401 ◽  
Author(s):  
Sidney I. Resnick ◽  
R. J. Tomkins
Keyword(s):  
Markov Chain ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Necessary And Sufficient Conditions ◽  
Finite Markov Chain ◽  
Almost Sure Stability ◽  
Normalizing Constants ◽  
The Stability ◽  
Necessary And Sufficient

For random variables {Xn, n ≧ 1} unbounded above set Mn = max {X1, X2, …, Xn}. When do normalizing constants bn exist such that Mn/bn→ 1 a.s.; i.e., when is {Mn} a.s. stable? If {Xn} is i.i.d. then {Mn} is a.s. stable iff for all and in this case bn ∼ F–1 (1 – 1/n) Necessary and sufficient conditions for lim supn→∞, Mn/bn = l > 1 a.s. are given and this is shown to be insufficient in general for lim infn→∞Mn/bn = 1 a.s. except when l = 1. When the Xn are r.v.'s defined on a finite Markov chain, one shows by means of an analogue of the Borel Zero-One Law and properties of semi-Markov matrices that the stability problem for this case can be reduced to the i.i.d. case.

Almost sure stability of maxima

1973 ◽  
Vol 10 (02) ◽  
pp. 387-401 ◽  
Author(s):  
Sidney I. Resnick ◽  
R. J. Tomkins
Keyword(s):  
Markov Chain ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Necessary And Sufficient Conditions ◽  
Finite Markov Chain ◽  
Almost Sure Stability ◽  
Normalizing Constants ◽  
The Stability ◽  
Necessary And Sufficient

For random variables {Xn, n≧ 1} unbounded above setMn= max {X1,X2, …,Xn}. When do normalizing constantsbnexist such thatMn/bn→1 a.s.; i.e., when is {Mn} a.s. stable? If {Xn} is i.i.d. then {Mn} is a.s. stable iff for alland in this casebn∼F–1(1 – 1/n) Necessary and sufficient conditions for lim supn→∞,Mn/bn= l >1 a.s. are given and this is shown to be insufficient in general for lim infn→∞Mn/bn= 1 a.s. except whenl= 1. When theXnare r.v.'s defined on a finite Markov chain, one shows by means of an analogue of the Borel Zero-One Law and properties of semi-Markov matrices that the stability problem for this case can be reduced to the i.i.d. case.

Normal approximations to discrete unimodal distributions

1986 ◽  
Vol 23 (04) ◽  
pp. 1013-1018
Author(s):  
B. G. Quinn ◽  
H. L. MacGillivray
Keyword(s):  
Stationary Distribution ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Hypergeometric Distribution ◽  
Death Process ◽  
Normal Approximations ◽  
Discrete Random Variables ◽  
Birth Death

Sufficient conditions are presented for the limiting normality of sequences of discrete random variables possessing unimodal distributions. The conditions are applied to obtain normal approximations directly for the hypergeometric distribution and the stationary distribution of a special birth-death process.

On the Mathematical Basis of Zelen’s Prerandomized Designs

1985 ◽  
Vol 24 (03) ◽  
pp. 120-130 ◽  
Author(s):  
E. Brunner ◽  
N. Neumann
Keyword(s):  
Clinical Trial ◽  
Normal Distribution ◽  
Random Variables ◽  
Small Samples ◽  
Selection Effects ◽  
Sample Sizes ◽  
Mathematical Basis ◽  
Additional Assumptions

SummaryThe mathematical basis of Zelen’s suggestion [4] of pre randomizing patients in a clinical trial and then asking them for their consent is investigated. The first problem is to estimate the therapy and selection effects. In the simple prerandomized design (PRD) this is possible without any problems. Similar observations have been made by Anbar [1] and McHugh [3]. However, for the double PRD additional assumptions are needed in order to render therapy and selection effects estimable. The second problem is to determine the distribution of the statistics. It has to be taken into consideration that the sample sizes are random variables in the PRDs. This is why the distribution of the statistics can only be determined asymptotically, even under the assumption of normal distribution. The behaviour of the statistics for small samples is investigated by means of simulations, where the statistics considered in the present paper are compared with the statistics suggested by Ihm [2]. It turns out that the statistics suggested in [2] may lead to anticonservative decisions, whereas the “canonical statistics” suggested by Zelen [4] and considered in the present paper keep the level quite well or may lead to slightly conservative decisions, if there are considerable selection effects.

Modified algorithm for fast bandwidth selection for kernel estimates of multidimensional probability densities

2020 ◽  
pp. 9-13
Author(s):  
A. V. Lapko ◽  
V. A. Lapko
Keyword(s):  
Probability Density ◽  
Optimal Parameter ◽  
Random Variables ◽  
Kernel Functions ◽  
Independent Random Variables ◽  
Functional Dependencies ◽  
Approximation Properties ◽  
Probability Density Estimation ◽  
Multidimensional Probability ◽  
Selection Of

An original technique has been justified for the fast bandwidths selection of kernel functions in a nonparametric estimate of the multidimensional probability density of the Rosenblatt–Parzen type. The proposed method makes it possible to significantly increase the computational efficiency of the optimization procedure for kernel probability density estimates in the conditions of large-volume statistical data in comparison with traditional approaches. The basis of the proposed approach is the analysis of the optimal parameter formula for the bandwidths of a multidimensional kernel probability density estimate. Dependencies between the nonlinear functional on the probability density and its derivatives up to the second order inclusive of the antikurtosis coefficients of random variables are found. The bandwidths for each random variable are represented as the product of an undefined parameter and their mean square deviation. The influence of the error in restoring the established functional dependencies on the approximation properties of the kernel probability density estimation is determined. The obtained results are implemented as a method of synthesis and analysis of a fast bandwidths selection of the kernel estimation of the two-dimensional probability density of independent random variables. This method uses data on the quantitative characteristics of a family of lognormal distribution laws.

Methodology of Calculation the Terminal Settling Velocity Distribution of Irregular Particles for High Values of the Reynold’s Number/Metodologia Wyliczania Rozkładu Granicznej Prędkości Opadania Ziaren Nieregularnych Dla Wysokich Wartości Liczb Reynoldsa

2014 ◽  
Vol 59 (2) ◽  
pp. 553-562 ◽  
Author(s):  
Agnieszka Surowiak ◽  
Marian Brożek
Keyword(s):  
Velocity Distribution ◽  
Settling Velocity ◽  
Random Variables ◽  
Independent Random Variables ◽  
Calculation Algorithm ◽  
Shape Coefficient ◽  
Geometrical Properties ◽  
Size And Shape ◽  
Physical Density ◽  
Settling Velocity Distribution

Abstract Settling velocity of particles, which is the main parameter of jig separation, is affected by physical (density) and the geometrical properties (size and shape) of particles. The authors worked out a calculation algorithm of particles settling velocity distribution for irregular particles assuming that the density of particles, their size and shape constitute independent random variables of fixed distributions. Applying theorems of probability, concerning distributions function of random variables, the authors present general formula of probability density function of settling velocity irregular particles for the turbulent motion. The distributions of settling velocity of irregular particles were calculated utilizing industrial sample. The measurements were executed and the histograms of distributions of volume and dynamic shape coefficient, were drawn. The separation accuracy was measured by the change of process imperfection of irregular particles in relation to spherical ones, resulting from the distribution of particles settling velocity.

Sign in / Sign up

Export Citation Format

Share Document