Previous Page 2

Displaying 21 – 29 of 29

Showing per page

On the Mathematical Theory of Records

Alexei Stepanov (2021)

Communications in Mathematics

In the present work, we briefly analyze the development of the mathematical theory of records. We first consider applications associated with records. We then view distributional and limit results for record values and times. We further present methods of generation of continuous records. In the end of this work, we discuss some tests based on records.

On the minimizing point of the incorrectly centered empirical process and its limit distribution in nonregular experiments

Dietmar Ferger (2005)

ESAIM: Probability and Statistics

Let F n be the empirical distribution function (df) pertaining to independent random variables with continuous df F . We investigate the minimizing point τ ^ n of the empirical process F n - F 0 , where F 0 is another df which differs from F . If F and F 0 are locally Hölder-continuous of order α at a point τ our main result states that n 1 / α ( τ ^ n - τ ) converges in distribution. The limit variable is the almost sure unique minimizing point of a two-sided time-transformed homogeneous Poisson-process with a drift. The time-transformation...

On the minimizing point of the incorrectly centered empirical process and its limit distribution in nonregular experiments

Dietmar Ferger (2010)

ESAIM: Probability and Statistics

Let Fn be the empirical distribution function (df) pertaining to independent random variables with continuous df F. We investigate the minimizing point τ ^ n of the empirical process Fn - F0, where F0 is another df which differs from F. If F and F0 are locally Hölder-continuous of order α at a point τ our main result states that n 1 / α ( τ ^ n - τ ) converges in distribution. The limit variable is the almost sure unique minimizing point of a two-sided time-transformed homogeneous Poisson-process with a drift. The time-transformation...

On the optimality of the max-depth and max-rank classifiers for spherical data

Ondřej Vencálek, Houyem Demni, Amor Messaoud, Giovanni C. Porzio (2020)

Applications of Mathematics

The main goal of supervised learning is to construct a function from labeled training data which assigns arbitrary new data points to one of the labels. Classification tasks may be solved by using some measures of data point centrality with respect to the labeled groups considered. Such a measure of centrality is called data depth. In this paper, we investigate conditions under which depth-based classifiers for directional data are optimal. We show that such classifiers are equivalent to the Bayes...

One Bootstrap suffices to generate sharp uniform bounds in functional estimation

Paul Deheuvels (2011)

Kybernetika

We consider, in the framework of multidimensional observations, nonparametric functional estimators, which include, as special cases, the Akaike–Parzen–Rosenblatt kernel density estimators ([1, 18, 20]), and the Nadaraya–Watson kernel regression estimators ([16, 22]). We evaluate the sup-norm, over a given set 𝐈 , of the difference between the estimator and a non-random functional centering factor (which reduces to the estimator mean for kernel density estimation). We show that, under suitable general...

Optimal mean-variance bounds on order statistics from families determined by star ordering

Tomasz Rychlik (2002)

Applicationes Mathematicae

We present optimal upper bounds for expectations of order statistics from i.i.d. samples with a common distribution function belonging to the restricted family of probability measures that either precede or follow a given one in the star ordering. The bounds for families with monotone failure density and rate on the average are specified. The results are obtained by projecting functions onto convex cones of Hilbert spaces.

Order statistics and ( r , s ) -entropy measures

María Dolores Esteban, Domingo Morales, Leandro Pardo, María Luisa Menéndez (1994)

Applications of Mathematics

K. M. Wong and S. Chen [9] analyzed the Shannon entropy of a sequence of random variables under order restrictions. Using ( r , s ) -entropies, I. J. Taneja [8], these results are generalized. Upper and lower bounds to the entropy reduction when the sequence is ordered and conditions under which they are achieved are derived. Theorems are presented showing the difference between the average entropy of the individual order statistics and the entropy of a member of the original independent identically distributed...

Currently displaying 21 – 29 of 29

Previous Page 2