A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TLDR
In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.Abstract:
In many cases an optimum or computationally convenient test of a simple hypothesis $H_0$ against a simple alternative $H_1$ may be given in the following form. Reject $H_0$ if $S_n = \sum^n_{j=1} X_j \leqq k,$ where $X_1, X_2, \cdots, X_n$ are $n$ independent observations of a chance variable $X$ whose distribution depends on the true hypothesis and where $k$ is some appropriate number. In particular the likelihood ratio test for fixed sample size can be reduced to this form. It is shown that with each test of the above form there is associated an index $\rho$. If $\rho_1$ and $\rho_2$ are the indices corresponding to two alternative tests $e = \log \rho_1/\log \rho_2$ measures the relative efficiency of these tests in the following sense. For large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample of size $en$ with the second test. To obtain the above result, use is made of the fact that $P(S_n \leqq na)$ behaves roughly like $m^n$ where $m$ is the minimum value assumed by the moment generating function of $X - a$. It is shown that if $H_0$ and $H_1$ specify probability distributions of $X$ which are very close to each other, one may approximate $\rho$ by assuming that $X$ is normally distributed.read more
Citations
More filters
Book ChapterDOI
An Introduction to Multifractal Distribution Functions
TL;DR: In this article, an alternative presentation of this subject is put forward, extending and streamlining the original approach in Mandelbrot 1974, which is addressed to both the beginner in multifractals and the seasonal professional.
Journal ArticleDOI
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
TL;DR: This work gives the first label-setting and label-correcting algorithms that run in linear time O(n + m) on the average of single-source shortest-path algorithms assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0,1].
Journal ArticleDOI
Distributionally Robust Monte Carlo Simulation: A Tutorial Survey
Constantino Lagoa,B.R. Barmish +1 more
TL;DR: This new method of Monte Carlo simulation was developed with the robustician in mind in that it begins only with bounds on the uncertain parameters and no a priori probability distribution is assumed.
Journal ArticleDOI
On the Variance of the Height of Random Binary Search Trees
Luc Devroye,Bruce H. Reed +1 more
TL;DR: It is shown that there exists a constant $\alpha = 4.31107\ldots$ such that H_n - \alpha \log n | > \beta \log log n \to 0$, where $\beta>15 \alpha / \ln 2 = 93.2933$ and the proof uses the second moment method.
References
More filters