Mean, Median and Mode in Binomial Distributions
From MaRDI portal
Publication:3888322
DOI10.1111/j.1467-9574.1980.tb00681.xzbMath0444.62021OpenAlexW2056411324WikidataQ56039130 ScholiaQ56039130MaRDI QIDQ3888322
Publication date: 1980
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9574.1980.tb00681.x
Related Items (27)
Characterising bounded expansion by neighbourhood complexity ⋮ On the law of the iterated logarithm for trigonometric series with bounded gaps. II ⋮ Bernoulli trials of fixed parity, random and randomly oriented graphs ⋮ The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions ⋮ An elementary analysis of the probability that a binomial random variable exceeds its expectation ⋮ Attacks on pseudo random number generators hiding a linear structure ⋮ A lower bound on the probability that a binomial random variable is exceeding its mean ⋮ On the probability that a binomial variable is at most its expectation ⋮ Efficient random graph matching via degree profiles ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ The median of the number of simple paths on three vertices in the random graph ⋮ Network Coloring and Colored Coin Games ⋮ On dimension-dependent concentration for convex Lipschitz functions in product spaces ⋮ On the choice of the optimal single order statistic in quantile estimation ⋮ Optimal play for multiple lottery wins ⋮ Computing highly accurate or exact \(P\)-values using importance sampling ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Robust mechanisms for risk-averse sellers ⋮ Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax ⋮ Maximal meaningful events and applications to image analysis ⋮ BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING ⋮ When the a contrario approach becomes generative ⋮ Successive shortest paths in complete graphs with random edge weights ⋮ Fast segment insertion and incremental construction of constrained Delaunay triangulations ⋮ Sparse PSD approximation of the PSD cone
Cites Work
This page was built for publication: Mean, Median and Mode in Binomial Distributions
